Two Sum

easy
10:00

Ready for your interview?

Two Sumeasy

Your AI interviewer will speak to you. Your mic will be on by default — just talk naturally. You can mute/unmute anytime.

Problem

Two Sum

easy
ArrayHash Table

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.

Examples

Input: nums = [2,7,11,15], target = 9 → Output: [0,1]
Input: nums = [3,2,4], target = 6 → Output: [1,2]

Constraints

  • 2 <= nums.length <= 10^4
  • -10^9 <= nums[i] <= 10^9
  • Only one valid answer exists.
Code Editor
Loading...
Output
Run your code to see output here