# X-Fast Trie Predecessor Queries: Walkthrough
X-Fast Trie Predecessor Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Store every prefix of each key in a hash table plus level pointers so a binary search over bit prefixes finds the nearest ancestor, then follow a descendant pointer.
## 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 log u) with O(n log u) space.
## Common mistake
Binary searching the prefixes without storing them all, which cannot jump to the right level.
## 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 real-time AI interview assistant for live interviews.