Shortest Path in Binary Matrix: coding question

Available question text

Given an n×n binary grid where 0s are open and 1s are blocked, return the length (number of cells) of the shortest 8-directionally connected path from (0,0) to (n−1,n−1), or -1 if none exists. Core challenge: find the shortest path in a grid with obstacles—typical solution uses BFS over the 8 neighbors (n ≤ 100).

Continue with questions that share topics or the same question type.

Shortest Path in a Grid with Obstacles Elimination
Coding · Array · Breadth-First Search · Matrix
Find the Safest Path in a Grid
Coding · Array · Binary Search · Breadth-First Search
Shortest Distance from All Buildings
Coding · Array · Breadth-First Search · Matrix
Contain Virus
Coding · Array · Breadth-First Search · Depth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 2 records

Amazon
Leetcode 1091. Shortest Path in Binary Matrix
Reported Feb 6, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 1091. Shortest Path in Binary Matrix
Reported Dec 23, 2025 · 38 source reports
MANAGER, MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Anduril
Shortest Path in Binary Matrix
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 92.2. This is not an interview probability.
View source
Anduril
Shortest Path in Binary Matrix

Available question text

Shortest Path in Binary Matrix

Available question text

Related questions

Shortest Path in Binary Matrix

Available question text

Related questions