Software Engineer
Shortest Path Avoiding Banned Countries
Given a list of edges representing connections between countries (0 to n-1) and a list of banned countries that cannot be visited, find the shortest path from a specified source to a destination. Use BFS and keep track of previous countries.
This question was asked in
Google Software Engineer Interview Experience
The Google interview experience consisted of five rounds, focusing on a variety of technical and behavioral assessments. Candidates can expect to tackle CPU scheduling challenges and matrix manipulation problems in the first two rounds, followed by BFS and graph-related questions. The later rounds delve into behavioral assessments, including handling team dynamics and time management. Overall, the experience is technically rigorous and demanding, making candidates demonstrate strong problem-solving skills throughout the process.