The interview was divided into two stages.

First was a qualifier round where I was asked to solve a couple of data structure questions on a whiteboard. Later, I was called for a full-day process on Saturday.

There were 15-20 candidates. Every round was an elimination round. There were a total of 43 technical rounds followed by one interview/discussion with the hiring manager.

I was told on the same day that they were going to offer me the position.

There is a stack of disks on a plate. All of the disks have a different radius. What is the best way to sort these disks so that the largest come at the bottom?

There is an MxN matrix. Write a program to print matrix nodes in spiral fashion.

There is a balanced binary tree. Write a program to print the sum of mirror image nodes in inorder fashion.

There are 2 numbers, M and N, given. Write a program to find the number of bits that need to be flipped in M to convert it into N.