# Making File Names Unique: Explained
Making File Names Unique shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Assign names in order; if a name is taken, append (k) with the smallest positive k that is free, and then that new name is also reserved. A hashmap stores the next k to try for each base (and every generated name). Jumping k forward avoids rescanning.
## 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
Restarting k from 1 for every collision without caching, or not inserting the suffixed name into the used set.
## 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 Linkjob.ai.