Two Sum

Easy

HashMap

Time Limit: 1000ms

Memory Limit: 128MB

Problem Description

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.

Constraints

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

Input

nums = [2, 7, 11, 15]

target = 9

Output

[0,1]

Available Test Cases:5 test cases

Test Case 1Sample

Input: {"nums": [2, 7, 11, 15], "target": 9}

Expected Output: [0,1]

Test Case 2Sample

Input: {"nums": [3, 2, 4], "target": 6}

Expected Output: [1,2]

Test Case 3Sample

Input: {"nums": [3, 3], "target": 6}

Expected Output: [0,1]

Test Case 4Sample

Input: {"nums": [1, 2, 3, 4, 5], "target": 8}

Expected Output: [2,4]

⚠️ Hidden test case

Test Case 5Sample

Input: {"nums": [-1, -2, -3, -4, -5], "target": -8}

Expected Output: [2,4]

⚠️ Hidden test case