Maximize Score After Pair Deletions

Given a sequence where you can repeatedly remove pairs of elements (following the problem’s pairing rules) and earn a score for each removed pair, compute the maximum total score achievable by choosing which pairs to delete and in what order. The challenge is an optimization over pairings with interdependent deletions, typically solved with dynamic programming (interval or bitmask) or matching techniques.