Google | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview consisted of a technical round followed by behavioral questions. The technical round lasted approximately 40 minutes, focusing on problem-solving and algorithmic skills. The candidate was asked to find a path in a given m*n array with different heights, ensuring the maximum height on the path from (0,0) to (m-1,n-1) is minimized. Dijkstra’s algorithm was discussed, along with a follow-up question about the feasibility of using DFS and its time complexity.
Technical Questions
- Path With Minimum Effort (Graph, Shortest Path, Priority Queue)
Tips & Insights
- Be prepared to discuss how to handle team dynamics, especially when credit for work is not shared.
- Have examples ready for multitasking experiences and strategies for dealing with unreasonable demands.
- Consider how to navigate company culture, particularly in environments that may be challenging.