There were a total of four interview rounds after passing the online assessment round. In each interview, two questions were asked, except in the bar raiser round. Mostly, DSA was asked. Overall, the difficulty was average.

Topics:

• Bit manipulation
• Sorting
• Trees
• Divide and Conquer
• Greedy
• Dynamic Programming

Lowest Common Ancestor of a Binary Tree

In an array, every element is present twice except one. Need to find that element without using any extra space.

In a BST, we need to find a pair whose sum is equal to a given element x without using a map.

Situational-based questions for checking whether the candidates adhere to leadership principles.