Google Coding Round | L5 | Banga - Google

Summary

During my Google L5 coding interview in Bangalore, I was presented with a complex grid traversal problem that required finding the shortest path while maximizing distance from zombies. The problem was similar to a LeetCode challenge but with unique constraints.

Full Experience

I was asked to solve a problem where I had to navigate a grid with zombies, walls, and open paths. The main challenge was to find the shortest path to the gate while staying as far away from zombies as possible. The problem required a custom approach to prioritize safety while maintaining path efficiency.

Interview Questions (1)

Find the Safest Path in a Grid

Data Structures & AlgorithmsHard

Given a grid representing a maze with various obstacles, the task is to find the shortest path from the start to the gate while staying as far away from zombies as possible. The grid contains walls, zombies, open paths, and a start and gate position.

Help the Community

Google Coding round | L5 | Bangalore

Summary

Full Experience

Interview Questions (1)

Join the Discussion

No comments yet