30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 1091. Shortest Path in Binary Matrix

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).

Asked at:

Meta

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid October, 2025

Meta

Mid-level

Mid September, 2025

Meta

Senior

Early September, 2025

Meta

Mid-level

Get Premium to View All 40+ Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1091. Shortest Path in Binary Matrix

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact