# Letter Case Permutation: Study Guide
Letter Case Permutation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
For a string of letters and digits, emit every string you can form by toggling the case of letters (digits stay). DFS or BFS: at a letter branch into lower/upper; at a digit keep it.
## 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(2^k * n) for k letters.
## Common mistake
Permuting the characters' order (this is about case, not anagrams) or skipping digits in the output.
## 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 AI job interview answers in real time.