Google | L5 | round 1 | India
- Location
- India
- Posted
- 4 Apr 2025
Summary
I recently had an interview round at Google where I was presented with a very challenging maze problem requiring universal instructions to exit from any starting position, and I derived a solution approach with some interviewer hints.
How it went
I gave one round of interview at google last week. I'm not sure what's happening at google because they are asking crazy hard question to people.
Questions asked (1)
- 01
Universal Maze Instructions
Data Structures & Algorithms · Hard
you are given an NxM maze where each cell is either empty or a wall . There is one cell which is exit from the maze. You are tasked to find a set of universal instructions like DDRLU which applied from any position will make you exit from the maze.