Your question is Find Two Numbers That Sum. 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.
Fiverr search services may need to identify two candidate gig scores whose combined value reaches a requested target. Given an integer array and a target integer, return the indices of two distinct elements whose values sum to the target.
Implement two_sum(nums, target), where nums is a list of integers and target is an integer. Return a list containing the two zero-based indices [i, j], with i < j, such that nums[i] + nums[j] == target. Each input contains exactly one valid pair. Do not use the same array element twice.
Your solution should run in expected O(n) time. The returned indices may be in any order unless the implementation naturally returns them in ascending order.
def two_sum(nums, target):