# Delete And Earn: Walkthrough

Delete And Earn shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Bucket sums by value (earning value * frequency). Because taking v deletes v-1 and v+1, the buckets reduce to house-robber on the sorted unique values (or on a dense array from min to max).

## 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 + W).

## Common mistake

Treating it as unbounded knapsack over the original positions and accidentally taking both a number and its neighbor.

## 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.