Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1036. Escape a Large Maze
Determine if you can reach target from source on a 10^6×10^6 grid with at most 200 blocked cells — the key challenge is that the blocked cells can form a small enclosed region despite the huge grid, so you must detect enclosure rather than search the whole grid. The typical approach is a bounded BFS/DFS from both source and target limited by the maximum area those blocked cells can enclose (≈O(N^2) with N≤200) to decide reachability.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.