Two Sum

Given an array of integers *nums* and an integer *target*, return *indices of the two numbers* such that they add up to *target*. You may assume each input has exactly one solution, and you may not use the same element twice. You can return the answer in any order.

Input Format

nums = [array of integers], target = integer

Output Format

int[] (two indices)

Constraints

  • 2 <= nums.length <= 10^5; -10^9 <= nums[i], target <= 10^9; only one valid answer exists.

Examples

Example 1:

Input:

nums = [2,7,11,15]
target = 9

Output:

[0,1]

Explanation:

nums[0] + nums[1] = 2 + 7 = 9, so return [0, 1].

Example 2:

Input:

nums = [3,2,4]
target = 6

Output:

[1,2]

Explanation:

nums[1] + nums[2] = 2 + 4 = 6.

Loading...
Two Sum - Hashing DSA Problem