𝐈𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐑𝐨𝐮𝐧𝐝𝐬:
- 1 online assessment – 60 mins
- 2 Technical + Googleyness Rounds – 60 mins
- 1 Technical Round – 45 mins
𝐑𝐨𝐮𝐧𝐝 𝟏:
Two coding questions. One question was on priority queues, while the other tested mathematical problem-solving skills.
𝐑𝐨𝐮𝐧𝐝 𝟐:
Graph question, which I approached using a BFS algorithm. As a follow-up question, I opted for Dijkstra’s algorithm approach, which satisfied the interviewer.
𝐑𝐨𝐮𝐧𝐝 𝟑:
A dynamic programming question in this round.
𝐑𝐨𝐮𝐧𝐝 𝟒:
A geometric challenge on a 2D plane.I proposed a solution using HashMaps and Binary Search.