Your question is Two Sum Optimized. 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.
Ancestry may need to identify two values from a list of record-related measurements whose combined value matches a specified target. Given an integer array nums and an integer target, return the indices of two distinct elements whose values add up to target.
Use an optimized approach that does not compare every pair with nested loops. You may assume that each valid input contains exactly one solution, and the same array element cannot be used twice.
nums, a list of integers, and target, an integer.[i, j], where i < j and nums[i] + nums[j] == target.two_sum(nums, target).def two_sum(nums, target):