The initial round was a phone screening. Two problems were given to be solved.

One was a straightforward implementation of a dynamic list of integers with methods to add to the list, delete from the list, fetch the integer at an index, and return the size. The other was a complex recursion problem.

Once the telephonic round was cleared, I was invited to their office for a face-to-face interview. It consisted of five rounds:

• Two rounds of coding, algorithm, and data structures.
• One designing round.
• One host manager round.
• A last technical communication round.

The coding rounds are the most crucial ones, as they basically form the screening criteria for hiring a candidate. You are required to solve the problem and then write error-free code on the whiteboard, handling all possible edge cases. It will be a piece of cake if you can explain the approach first and then put that down to code. You will mostly be asked to do a dry run at the end.

Designing rounds were the usual brainstorming sessions. You should be able to back your design with proper metrics (throughput, responsiveness, data scale, etc.). Keep an eye on scalability, as that's what the panel will be hinting at.

The host manager round was a different flavor of a designing round. It was a bit tougher for me. Be as innovative and spontaneous as you can with the technologies you are aware of.

Technical communication is where you need to describe your current project in layman's terms.

1. You are given an N-Dimensional list with two methods: i) getDim -> returns the dimensions. e.g., [5,4,3]. ii) getElement([i,j,k]) -> returns list[i][j][k]. You have to implement a method to sum all elements in the list.

2. Serialize and deserialize a binary tree.

Rest of the problems were from graph traversals and kth order statistics.