Coding Challenge

Solve algorithmic problems and improve your coding skills

Two Sum

Given an array of integers nums and an integer target, return indices of the two numbers in the array 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]

💡 Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

⚠️Constraints

  • 2 <= nums.length <= 104
  • -109 <= nums[i] <= 109
  • -109 <= target <= 109
  • Only one valid answer exists.

⏱️Challenge Timer

30:00
⏸️ Timer Paused

💻Code Editor

JavaScript
Loading...