# Minimum Number Of Steps To Make Two Strings Anagram: Explained
Minimum Number Of Steps To Make Two Strings Anagram shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count letters of s minus letters of t; the sum of positive differences is the number of replacements needed in t.
## 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
Summing absolute differences, which double counts.
## 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 here.