Available question text
Given a binary matrix where 1 represents land and 0 represents water, find any valid path from the top-left corner (0,0) to the bottom-right corner (n-1,n-1). You can only move in 4 directions (up, down, left, right) and only step on land cells.
Related questions
Continue with questions that share topics or the same question type.
- Disconnect Path in a Binary Matrix by at Most One Flip
Coding
- Shortest Path in Binary Matrix
Coding · Array · Breadth-First Search · Matrix
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Find Path in Binary Matrix
Reported Oct 23, 2025 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source