1. Find a equilibrium index in array.



2. find the minimum no of jumps required to reach the end of array.where element at each index represent how many max moves you will take in right.



3. Tournament tree puzzle and write code for that.



4. Find the 2 maximum elements in array in O(n+log(n)) comparison.



5. Celebrity Problem puzzle and write code for that.



6. given a 2D array of 0 and 1. where each row is sorted. find the row with maximum no of 1 in minimum time complexcity.

HAVE YOUR SAY...