# Maximum Total Damage With Spell Casting: Walkthrough
Maximum Total Damage With Spell Casting shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Casting damage x bans x-2..x+2 except x itself. Group equal damages and run house-robber on the sorted unique values: take this value and skip neighbors within distance 2, or skip 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(n log n).
## Common mistake
Banning only x-1 and x+1, or treating duplicates as separately banned values.
## 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 the Linkjob AI app.