Leetcode 3040. Maximum Number of Operations With the Same Score II

Given an array where you may repeatedly remove either the first two, the last two, or the first and last elements, maximize how many such pair-removals can be performed so every removed pair has the same sum. Equivalently, determine for each possible target pair-sum how many disjoint end-pairings can be formed under the allowed end-removal rules and return the maximum.