Available question text
Given a grid maze where a ball, once rolled, continues in a direction until it hits a wall, determine whether the ball can reach and stop exactly at the destination. Core challenge: treat the cells where the ball stops as graph nodes and use graph search (BFS/DFS) over those stopping positions rather than step-by-step moves.
Related questions
Continue with questions that share topics or the same question type.
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 · 2 records
Meta
Leetcode 490. The Maze
Reported Aug 26, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceSalesforce
Leetcode 490. The Maze
Reported May 3, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source