← Back to Problems
1. Two Sum
1. Two Sum
Easyarrayhash-table
Companies: Google, Amazon, Meta, Microsoft, Apple
Acceptance: 49.2%👍 45231|👎 1523
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.
Examples
Input:
nums = [2,7,11,15], target = 9
Output:
[0,1]
Explanation:
Because nums[0] + nums[1] == 9, we return [0, 1].
Input:
nums = [3,2,4], target = 6
Output:
[1,2]
Explanation:
Because nums[1] + nums[2] == 6, we return [1, 2].
Input:
nums = [3,3], target = 6
Output:
[0,1]
Explanation:
Because nums[0] + nums[1] == 6, we return [0, 1].
Constraints
- •
2 <= nums.length <= 104 - •
-109 <= nums[i] <= 109 - •
-109 <= target <= 109 - •Only one valid answer exists.
Hints
Related Problems
Loading...
Run your code to see test results
Test Case 1
Input:
{"nums":[2,7,11,15],"target":9}Expected Output:
[0,1]
Test Case 2
Input:
{"nums":[3,2,4],"target":6}Expected Output:
[1,2]
Test Case 3
Input:
{"nums":[3,3],"target":6}Expected Output:
[0,1]
