Shortest Path in Binary Matrix (Popular) Problem

Shortest Path in Binary Matrix (Popular) Problem — ExecCode Medium DSA Practice

Solve the Shortest Path in Binary Matrix (Popular) problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Shortest Path in Binary Matrix (Popular). 8-direction BFS. For Shortest Path in Binary Matrix (Popular), focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input {"grid": [[0, 1], [1, 0]]}; Output 2

Constraints

1 ≤ n ≤ 10^5

Practice Shortest Path in Binary Matrix (Popular) free on ExecCode. Browse DSA problems, topic map, and placement guides.