1st round (Online)
30 MCQs and 2 Coding questions
1) Find the position of the rightmost and leftmost set bit of a number.
2) Given an equation of X, for example: X + 2 = 5, find X.
2nd round (F2F)
2 Coding questions
1) Given an array that represents the height of trees, you have to mandatorily cut down one and only one tree. Find the number of possible ways in which you can cut down a tree, so that all other trees are in an increasing order.
2) Rearrange characters in a string such that no two adjacent characters are same (Priority Queue)
3rd round (F2F)
3 questions
1) Find the Rotation Count in Rotated Sorted array (O(log(n)) solution)
2) Check if two trees are Mirror
3) Algorithm to minimize the file merge time (Min Heap)
4th round (F2F)
3 questions
1) Diameter of a Binary Tree
2) Difference between Overriding and Overloading
3) Compile time and runtime polymorphism