They conducted an objective test and a coding test with three codes. The codes were pretty easy and doable. One code involved sorting a linked list such that nodes at odd locations were sorted in increasing order and nodes at even positions were sorted in decreasing order.

The selected candidates were interviewed over three rounds. These rounds, however, were not conducted at a similar difficulty level for everyone; they were mostly random with a lot of variation.

Overall, they asked technical questions on data structures, OS, OOPs, and a few puzzles and brain-teasers.

The interviewer expected me to code Dijkstra's algorithm and AVL tree rotations in the interview round within 10 minutes. It was quite out of the regular way.