1. Given array find median of elements that are less than given number k. k exist in the array 2. Find number of polindrome dates (MMDDYYYY) in century (ex 1000-9999). 3. You are given an array of numbers (old trades) with label (good, bad). Predict label for the new array. I spent a lot of time thinking about it, but it seems very simple question. Solved with simple approach got 4/5 test cases. 4. Given a grid with 0s -1s and 1. You can walk on 0s only and try to reach 1s. Print if you can reach or not. I think related to path finding algorithm. Hope this will be helpful to someone else.