Skip to content

problem20.md

Latest commit

 

History

History
17 lines (14 loc) · 732 Bytes

problem20.md

File metadata and controls

17 lines (14 loc) · 732 Bytes

Problem 20: Minimal Obstacle Bypass (Shortest Path in Binary Matrix)

Problem Statement

Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that:

  • All the visited cells of the path are 0.
  • All the adjacent cells of the path are 8-directionally connected.
  • The length of a clear path is the number of visited cells in this path.

Input Format

  • A 2D integer matrix grid.

Example

Input: grid = [[0, 1], [1, 0]]
Output: 2 Input: grid = [[0, 0, 0], [1, 1, 0], [1, 1, 0]]
Output: 4