Easy
Quiz
#1 Two Sum
APPROACH
Find two distinct indices in nums whose elements sum to target and return those indices. Exactly one valid solution is guaranteed; no element may be counted twice. The returned pair may be in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]
1 of 4
1:00
What is the optimal approach for this problem?