# Swap Adjacent In LR String: Interview Notes

Swap Adjacent In LR String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Ignore X's: the remaining L/R sequences must match. Each L can only move left (so its index may decrease) and each R can only move right.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Treating the string as freely sortable because XL and RX look swappable both ways.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.