Difficulty: Easy | Category: Array | Asked at: Google, Amazon, Meta | Platform: Unfoldd Arena
Solve Two Sum online for free in Python, JavaScript, Java, C++, TypeScript, Go, Rust, PHP, Swift, Kotlin, Dart, Ruby, C, and C#. Practice Easy level coding interview problems with instant test case evaluation and AI-powered analysis.
Keywords: Two Sum solution, Two Sum leetcode, Two Sum python, Two Sum javascript,Two Sum java, Two Sum approach, how to solve Two Sum, easy coding problems, Array problems, coding interview preparation, DSA practice free.
Given an array of integers
numstargettargetYou 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.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, 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]| Property | Limit |
|---|---|
| Array Length | 2 <= nums.length <= 10^4 |
| Element Value | -10^9 <= nums[i] <= 10^9 |
| Target Value | -10^9 <= target <= 10^9 |
Note: Only one valid answer exists.
Solve problems, verify your skills, and earn XP.