# Kth Smallest Instructions: Practice Notes
Kth Smallest Instructions shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You must walk from (0,0) to (destination) using exactly destination[0] 'V' and destination[1] 'H'. Return the k-th lex instruction string (1-indexed). At each step choose 'H' if k is within the C(remaining-1 moves, remaining V) strings that start with H; otherwise emit 'V' and subtract that count.
## 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((r+c)^2) with precomputed combinations, or O(r+c) with careful big-int/combinadic math.
## Common mistake
Generating all paths (they explode) or using 0-based k.
## 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 multilingual AI interview assistant.