I have been asked 2 problems in 45minutes.\n**one is something about given an array , decide its pattern change **\n\n[1,2,3,10,8,7,80,81,82] -> output: 3 (increasing pattern [1,2,3] + decreasing pattern[10,8,7] + increacing again[80,81,82] )\ndon\'t know where is similar problem in leetcode\n\n** Second is Leetcode 23. Merge k Sorted Lists (HARD)**\n\nI completed first one fully and second one with sude code, but couldn\'t complete full.\nAlso I have not been given problem function defination: Like for second question its not list of Integer but list of ListNode (Leetcode 23), interviewer had just typed input and output in coderpad, and its our part to decide whether it is Integers or listNodes, so there I went wrong with second hard problem.\n\n\nI never ecpected HARD question for this round though:(  just got rejection email from HR.\n\nHope this helps others.

I have been asked 2 problems in 45minutes.\none is something about given an array , decide its pattern change \n\n[1,2,3,10,8,7,80,81,82] -> output: 3 (increasi