# Delete And Earn: Practice Notes

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

## Key idea

House-robber on the value frequency array: if you take value v you must skip v-1 and v+1, so dp[v] = max(dp[v-1], dp[v-2] + v*count[v]).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n + maxV).

## Common mistake

Picking every unique value and not realizing adjacent values invalidate each other.

## 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 assistant for technical interviews.