InterviewDB Question

Nuro SWE Phone - Maze Runner (Graph/BFS)

Question Details

Problem Navigate through a maze grid from start to finish, typically finding the shortest path. Likely LeetCode equivalent Similar to LC 490 The Maze or LC 1926 Nearest Exit from Entrance in Maze. Tags graph, bfs, matrix, nuro

Full Details

🔒

Unlock all Nuro questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a nuro interview during the phone round.

It covers the following topics: Phone, Graph, Coding, Onsite, Matrix .