DEV Community

Cover image for 1. Two Sum
Chandrasekar Gokulanathan
Chandrasekar Gokulanathan

Posted on

1. Two Sum

Problem #1: https://leetcode.com/problems/two-sum/

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to the target. You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Enter fullscreen mode Exit fullscreen mode

Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Enter fullscreen mode Exit fullscreen mode

Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]
Enter fullscreen mode Exit fullscreen mode

Solution

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
    var complementMap = new Map();

    for(var j=0; j<nums.length; j++) {
        var complement = target - nums[j];
        if (complementMap.has(complement)) {
            return [complementMap.get(complement), j]
        }
        complementMap.set(nums[j], j);
    }
}
Enter fullscreen mode Exit fullscreen mode

Top comments (0)