Leetcode 740. Delete and Earn

Aggregate points for each distinct number (value * frequency), then choose a subset of values maximizing sum with the constraint that taking value x forbids taking x-1 and x+1. This is equivalent to selecting non-adjacent keys (like House Robber) and solved with dynamic programming over the value range.