Your question is Two Sum and Array Algorithms. 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.
Fundbox needs to identify two payment amounts whose combined value matches a requested total. Given an unsorted array, return the lexicographically smallest pair of distinct indices [i, j] where i < j and nums[i] + nums[j] == target.
If multiple pairs match, choose the pair with the smallest i. If several pairs have the same i, choose the smallest j. Return [] when no valid pair exists.
You may not use the same array element twice.
Implement find_payment_pair(nums, target):
nums, a list of integers, and target, an integer.def find_payment_pair(nums, target):