Shortest Path in Binary Matrix

Q: Shortest Path in Binary Matrix

Given an $n \times n$ binary matrix `grid`, return the length of the shortest clear path from the top-left to the bottom-right corner. A clear path uses only cells with 0. Use BFS.

Question

Accepted Answer

Given an $n 	imes n$ binary matrix `grid`, return the length of the shortest clear path from the top-left to the bottom-right corner. A clear path uses only cells with 0. Use BFS.

Shortest Path in Binary Matrix

Question Explain

Start Trying This Question Simulation

Other interview questions like this

Two Sum

Longest Substring Without Repeating Characters

Median of Two Sorted Arrays