 All Problems
Two Sum
easy
arrays
hash map
amazon
google
microsoft
facebook

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example 1:

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

Example 2:

Input: nums = [3,2,4], target = 6
Output: 1 2

Constraints:

  • 2 ≤ nums.length ≤ 10⁴
  • -10⁹ ≤ nums[i] ≤ 10⁹
  • Only one valid answer exists

Input format: First line: space-separated array. Second line: target integer.

Output format: Two space-separated indices.

Run to check your code against the sample cases, or submit to run every case