Shortest path in a grid with obstacles
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.
AmazonCodingNo answer yet. Write the first one; the best answer gets endorsed.