EasyAcceptance: 47.3%
1. Two Sum
Description
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
Example 1
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums + nums == 9, we return [0, 1].
Example 2
Input: nums = [3,2,4], target = 6
Output: [1,2]
Explanation: Because nums + nums == 6, we return [1, 2].
Constraints
- •2 <= nums.length <= 10^4
- •-10^9 <= nums[i] <= 10^9
- •-10^9 <= target <= 10^9
- •Only one valid answer exists.
Topics
ArrayHash Table
💡 Tip: Start with a brute force solution and then optimize. Don't worry about performance initially.
Want more challenges?
Explore more coding challenges and improve your problem-solving skills
Browse All Challenges →