Your question is Find Two Sum Indices. 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.
At Lyft, you are given an integer array and a target value. Return the indices of the two distinct elements whose sum equals the target.
Implement a function two_sum(nums, target) where:
nums is a list of integerstarget is an integer[i, j] such that nums[i] + nums[j] == targetdef two_sum(nums, target):