The interview process consisted of 8 coding rounds, primarily focused on LeetCode medium-level questions.

The topics covered during these rounds included:

• Data structures
• Algorithms
• Dynamic programming
• Graph theory
• System design

Additionally, there were behavioral questions that assessed problem-solving skills and collaboration within a team environment.

The overall experience was challenging yet rewarding.

Question: "How would you find the shortest path in a graph using Dijkstra's algorithm?"

How did you answer this question? (Optional): "I explained the steps of Dijkstra's algorithm:

• Initializing the distances to infinity.
• Using a priority queue to explore the nearest unvisited node.
• Updating the distances of the neighboring nodes.
• Repeating the process until all nodes were visited.

I also wrote the code to implement this solution during the interview."