4 views
# LC6399 Recover BST Swap **Key idea.** recursion with a clear base case. **Interview walkthrough** 1. Clarify inputs, constraints and edge cases 2. Brute force first, then the optimization 3. Code cleanly, dry-run one example 4. State time and space complexity *Disclosure: I work on [linkjob.ai](https://www.linkjob.ai/), a tool for coding interview practice. Personal study notes.*