google logo
Google· SDE III

Google Coding round | L5 | Bangalore

Result
Offer
Location
Bangalore
Posted
15 Dec 2025
566 reads

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.

How it went

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.

Questions asked (1)

  1. 01

    Find the Safest Path in a Grid

    Data Structures & Algorithms · Hard

    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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!