Leetcode 1210. Minimum Moves to Reach Target with Rotations

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.