# Find Kth Bit In Nth Binary String: Walkthrough
Find Kth Bit In Nth Binary String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
S1='0'; Sn = Sn-1 + '1' + reverse(invert(Sn-1)). Length is 2^n-1. Recurse on n and index: the middle bit is 1; left of middle looks up Sn-1; right of middle is the inverted reverse of Sn-1, i.e. invert of bit (len-1-index) in Sn-1.
## 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
Materializing the whole exponential string, or forgetting to invert after reversing the right half.
## 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 learn more.