Your question is Two-Sum Non-Repeating Pairs. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
A Tanium endpoint analysis routine receives an unsorted array of integer measurements and a target value. Return every distinct pair of values whose sum equals the target.
A pair is identified by its values, not by the indices that produced it. Duplicate values in the input must not cause duplicate pairs in the output. Within each pair, place the smaller value first. Return the collection of pairs sorted lexicographically by first value, then second value. If no pair exists, return an empty list.
Implement find_unique_pairs(nums, target).
nums, a list of integers, and target, an integer.target.[3] cannot produce [3, 3], but [3, 3] can.def find_unique_pairs(nums, target):