Two Sum
Algorithms
Easy
10 points
Find two numbers in an array that add up to a target sum.
Success Rate
0%
0 attempts
Problem Statement
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.
Input Format
nums = [2,7,11,15], target = 9
Output Format
[0,1]
Constraints
2 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Examples
Input:
nums = [2,7,11,15], target = 9Output:
[0,1]Explanation:
Because nums[0] + nums[1] == 9, we return [0, 1].
Input:
nums = [3,2,4], target = 6Output:
[1,2]Explanation:
Because nums[1] + nums[2] == 6, we return [1, 2].
Community Discussion
Quick Actions
Challenge Statistics
Total Attempts
0
Success Rate
0%
Difficulty
Easy
Points Reward
10
Supported Languages
Python
Javascript
Java
Cpp
Tags
#array
#hash-table