STEIM Practice · Problem Set
Solve. Submit. Level up.
3 problems available
Two Sum
EasyArrayHash TableGiven 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.
Example 1
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: nums[0] + nums[1] == 9, so we return [0, 1].
Example 2
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3
Input: nums = [3,3], target = 6
Output: [0,1]
Constraints
- • 2 <= nums.length <= 10^4
- • -10^9 <= nums[i] <= 10^9
- • Only one valid answer exists.
solution.js
Test Results
Run your code against 3 sample tests, then Submit for full evaluation.
Case 1: [[2,7,11,15],9]
Case 2: [[3,2,4],6]
Case 3: [[3,3],6]