Fast-paced and a great place to grow.
Doesn’t get time to spend on yourself.
One OA followed by two interviews. The first interview was based on DSA. Topics included DP, trees, and graphs. These were medium-level problems. The second interview consisted of one DSA question, situational questions, and personal projects.
Breadth-First Search (BFS) for a Graph The Breadth-First Search (BFS) algorithm is used to search a tree or graph data structure for a node that meets a set of criteria.
One Bar Raiser, one low-level design round, and one with two LeetCode problems. Leadership principles were assessed in all of the above rounds. The Bar Raiser round was stressful; they checked how you can manage in stressful situations.
One OA followed by two interviews. The first interview was based on DSA. Topics included DP, trees, and graphs. These were medium-level problems. The second interview consisted of one DSA question, situational questions, and personal projects.
Breadth-First Search (BFS) for a Graph The Breadth-First Search (BFS) algorithm is used to search a tree or graph data structure for a node that meets a set of criteria.
One Bar Raiser, one low-level design round, and one with two LeetCode problems. Leadership principles were assessed in all of the above rounds. The Bar Raiser round was stressful; they checked how you can manage in stressful situations.