# Smallest String With A Given Numeric Value: Interview Notes
Smallest String With A Given Numeric Value shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You want the lexicographically smallest string of length n whose letters sum to k (a=1..z=26). Greedily put as much weight as possible on the right: fill with 'a's, then from the end raise letters toward 'z' until the remaining extra (k-n) is spent.
## 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
Spending the extra on the left (which makes a larger string) or allowing a letter above 'z'.
## 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 undetectable AI interview copilot.