Array Addition Equals 10 | Dataford Interview Questions

For a Luxoft Singapore QA data-validation utility, identify every distinct pair of numbers in an integer array whose sum is exactly 10.

Return each pair as a two-element list [a, b], where a <= b. A pair is included only once by value, even if the same values occur at multiple indices. Each array element may be used at most once for a pair. Return the pairs sorted lexicographically. If no valid pair exists, return an empty list.

Formal Specification

Implement find_pairs(nums), where nums is a list of integers. The function returns a list of two-element lists containing all unique pairs whose values sum to 10.

Constraints

0 <= len(nums) <= 100000
-10^9 <= nums[i] <= 10^9
The target sum is fixed at 10
Return unique pairs by value, not by index
Each pair must be ordered as [a, b] with a <= b

Function Signature

def find_pairs(nums):

Your question is Array Addition Equals 10. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem