I knew LC 777 cold so I thought this was a gift.
Model the board as a circular string and recognize that pieces cannot cross, so their relative order is invariant. Check if the sequences of L and R pieces (ignoring dots) are identical in both configurations, and verify that each piece can move to its target position without violating the no-crossing constraint.
Pro tip: Clarify with the interviewer whether the board is circular and whether pieces can move simultaneously or one at a time; this affects the solution. Also, consider edge cases like empty boards or boards with only one type of piece.
Restate the problem to ensure clarity: pieces L and R on a circular board, dots are empty spaces, pieces cannot cross. Determine if start can become target.
Note that the relative order of L and R pieces is invariant because they cannot cross. Also, the number of L and R pieces must be the same in both configurations.
Verify that the sequences of L and R (ignoring dots) are identical in start and target. If not, transformation is impossible.
If the sequences match, argue that pieces can be moved one by one to their target positions without crossing, using empty spaces as buffers. Consider circular wrapping.
Consider cases with no pieces, only L or only R, and boards where start equals target. Also, consider if the board is circular and pieces can wrap around.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.