Round 1: Written round,
1. Convert Sorted array to BST.
2.Return row from the 2-D array which has maximum Number of 1.
3.Print next greater element
input-4 5 25 13 6 12
output -5 25 -1 -1 12 -1
Round 2: F2F
1. Find the missing number from 1 to N.N=12
0 1 2 3 4 5 10 12
output—6