Leetcode 3038. Maximum Number of Operations With the Same Score I

Given an array, pick a target score S and repeatedly remove disjoint pairs of elements whose sums equal S; return the maximum number of such operations (pairs) you can perform. Constraints are small (n ≤ 100, nums[i] ≤ 1000), so the challenge is finding the S that yields the most disjoint pairs.