Zero To DSAZero To DSA
Privacy Policy路FAQ路Report a Bug路Support on Ko鈥慺i
Group Anagrams

Two Sum (Optimal)

easy
Time: O(n)
Space: O(n)

Given an array of integers nums and an integer target, return indices of the two numbers that add up to target. Use O(n) time with a hash map.

Constraints

  • 2 <= nums.length <= 10^4
  • Exactly one valid answer exists.

Examples

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Input: nums = [3,2,4], target = 6
Output: [1,2]
Input: nums = [3,3], target = 6
Output: [0,1]