# Persistent Implicit Treap Split: Interview Notes
Persistent Implicit Treap Split shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Path-copy on split and merge so older versions of an implicit sequence stay intact while new versions insert, erase, or reverse ranges.
## 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
Expected O(log n) new nodes per update.
## Common mistake
Mutating a shared child pointer without copying the node, which silently changes an older version.
## 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 Linkjob AI copilot.