Management politics for increments and promotions.
There were three rounds. * The first round was for DS/Algo. * The second was for personal projects. * The third was an HR round. The first two rounds took one hour each, and the last was 30 minutes.
Focus on Data Structures and Algorithms. Knowledge of BSTs, stacks, and hash tables is essential. Graph Algorithms and Dynamic Programming are covered too. I was asked a question on Topological sorting (implement it with and without stacks) and an
There was only one round of interviews, which was around 1 hour long. The interviewer was a very chill guy. In the beginning, it started with an introduction, followed by a DSA question and then some other questions.
There were three rounds. * The first round was for DS/Algo. * The second was for personal projects. * The third was an HR round. The first two rounds took one hour each, and the last was 30 minutes.
Focus on Data Structures and Algorithms. Knowledge of BSTs, stacks, and hash tables is essential. Graph Algorithms and Dynamic Programming are covered too. I was asked a question on Topological sorting (implement it with and without stacks) and an
There was only one round of interviews, which was around 1 hour long. The interviewer was a very chill guy. In the beginning, it started with an introduction, followed by a DSA question and then some other questions.