Leetcode 546. Remove Boxes

Given an array of colored boxes where removing a contiguous group of k identical boxes yields k^2 points, compute the maximum score by choosing removals that may merge equal-colored boxes separated by others. This is a classic interval DP/memoization problem over subarray ranges with an extra parameter tracking same-color extensions (n ≤ 100).