# Find The Difference: Interview Notes
Find The Difference shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
t is s with one extra character (possibly shuffled). XOR every character of s and t (or subtract frequency counts); the leftover byte is the extra character. XOR of all ords also works because duplicates cancel.
## 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
Sorting both strings and scanning without handling the extra char at the end, or assuming it was appended rather than inserted anywhere.
## 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.