# Splay Tree Implicit Sequence Keys: Practice Notes
Splay Tree Implicit Sequence Keys shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Use subtree size instead of keys so split/kth/reverse become sequence operations; push lazy flags before walking on size.
## 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
Amortized O(log n).
## Common mistake
Reading a child's size before pushing a reverse flag, which swaps the meaning of the index.
## 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 AI interview helper that uses your resume.