Your question is Two Sum Algorithm. 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.
During automated QA checks for Nokia NetAct event processing, two event measurements may need to be matched against a required combined value. Given an integer array nums and an integer target, return the indices of two distinct elements whose values add up to target.
Use each array element at most once. You may assume that every valid input contains exactly one solution. Return the indices in ascending order of discovery, and return an empty list only if no pair exists.
Implement two_sum(nums, target).
nums, a list of integers, and target, an integer.i and j where nums[i] + nums[j] == target.def two_sum(nums, target):