Leetcode 3186. Maximum Total Damage With Spell Casting

Given an array of spell damages, pick a subset to maximize total damage under the rule that choosing any value v forbids using values v-2, v-1, v+1, and v+2. Reduce by aggregating total damage per distinct value and solve with dynamic programming over the sorted values to handle the ±2 exclusion.