← Questions
Shortest path in a grid with obstacles
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a 2D grid where some cells are blocked, find the length of the shortest path from the top-left cell to the bottom-right cell moving up, down, left or right, or return -1 if there is none. Explain why breadth-first search finds the shortest path and give its time and space.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding