Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3038. Maximum Number of Operations With the Same Score I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source