1. Two Sum

1. Two Sum

Easy
50.0%
1.3k
arrayhash-table
Google, Amazon

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

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

Constraints

  • 2 <= nums.length <= 10⁴
  • -10⁹ <= nums[i] <= 10⁹
  • -10⁹ <= target <= 10⁹
  • Only one valid answer exists.

Loading editor...

[2, 7, 11, 15], 9
[0, 1]

Console Output

Click "Run Code" or "Submit" to see results

Your code will be evaluated by AI with instant feedback