Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3235. Check if the Rectangle Corner Is Reachable
Determine whether there's a path inside the rectangle from (0,0) to (xCorner,yCorner) that stays strictly inside the rectangle (touches it only at the two corners) and does not touch or lie inside any given circles. Core challenge: model circles (and the rectangle sides/corners) as nodes in a graph/union-find where edges represent touching/overlap, then check whether any connected obstacle component covers a corner or forms a continuous barrier that blocks the two corners.
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.