Available question text
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.
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 · 1 record
No company association
Leetcode 3235. Check if the Rectangle Corner Is Reachable
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source