#1EasyArrays & Hashing· Hash Map Complement

Two Sum Target Lookup

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 that each input would have 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

Array of two indices [i, j]

Examples

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

Output: [0, 1]

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

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

Output: [1, 2]

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

Constraints

2 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Only one valid answer exists.

Study first

Variables & Data Types
Arrays & Contiguous Memory

#arrays
#hash-table
#programming-fundamentals