Available question text
Find the minimum number of moves to slide a 2-cell snake from the top-left to the bottom-right of an n×n obstacle grid using right/down moves and 90° rotations (when adjacent cells are empty); this is a shortest-path search over states (position + orientation) in the implicit graph, returning -1 if unreachable.
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 1210. Minimum Moves to Reach Target with Rotations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source