Breaking News: Grepper is joining You.com. Read the official announcement!

2 sum js solution

Gleaming Grasshopper answered on July 7, 2021 Popularity 4/10 Helpfulness 1/10

answer 2 sum js solution

related two sum javascript

2 sum js solution

Comment

function twoSum(numbers, target) {
    let result = [0, 0];
    if (numbers.length < 2) {
        return result;
    }
    let map = new Map();
    for (let i = 0; i < numbers.length; i++) {
        map.set(numbers[i], i + 1);
    }

    for (let j = 0; j < numbers.length; j++) {
        let remain = target - numbers[j];
        if (map.has(remain) && map.get(remain) > j + 1) {
            result[0] = j + 1;
            result[1] = map.get(remain);
            break;
        }
    }
    return result;
}

Popularity 4/10 Helpfulness 1/10 Language javascript

Source: chat.openai.com

Tags: javascript solution sum

Link to this answer
Share Copy Link

Contributed on Oct 14 2023

Gleaming Grasshopper

0 Answers Avg Quality 2/10

Closely Related Answers

two sum javascript

Comment

const nums = [3, 4, 5, 6, 7, 3]
const target = 6

const twoSum = function(nums, target) {
    let map = {}

    for (let i = 0; i < nums.length; i++) {
        if (target - nums[i] in map) {
            return [map[target - nums[i]], i]
        } else {
            map[nums[i]] = i
        }
    }

    return []
}

console.log(twoSum(nums, target))   // [Log]: [ 0, 5 ]

Popularity 10/10 Helpfulness 5/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Jul 18 2022

Mysterious Macaque

0 Answers Avg Quality 2/10

two sum javascript solution

Comment

var twoSum = function(nums, target) {
  const indicies = {}
  
  for (let i = 0; i < nums.length; i++) {
    const num = nums[i]
    if (indicies[target - num] != null) {
      return [indicies[target - num], i]
    }
    indicies[num] = i
  }
};

Popularity 10/10 Helpfulness 5/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Jul 07 2021

Easy Earthworm

0 Answers Avg Quality 2/10

two sum js

Comment

function twoSum(nums, target) {
    const viewed = []; // access by index is faster that Map
    for(let i=0; ;i++){ //according to task description - solution is always present - no need to check <.length or something like this
        const current = nums[i];
        const j = viewed[current];
        if(j !== undefined){
            return [i, j];
        }

        viewed[target - current] =  i; 
    }
};

Popularity 7/10 Helpfulness 3/10 Language javascript

Source: leetcode.com

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

two sum js

Comment

function sumDigit(nums, target) {
  let n = nums.length;

  for(let i = 0; i < n-1; i++) {
   for(let j = i+1; j < n; j++) {
    if(nums[i] + nums[j] === target) return [i,j]
   }
  }
  return []
}

sumDigit([3,2,4], 6)

// n-1 = last index dropped if -> n+1 add new index
// nums[i] = 332
// nums[j] = 244
// nums[i] + nums[j] -> 3+2 = 5 | 3+4 = 7 | 2+4 = 6

Popularity 7/10 Helpfulness 3/10 Language javascript

Source: Grepper

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

two sum js

Comment

function sumDigit(nums, target) {
  let n = nums.length;

  for(let i = 0; i < n - 1; i++) {
   for(let j = i + 1; j < n; j++) {
     if(nums[i] + nums[j] === target) return [i,j]
   }
  }
  return []
}

sumDigit([3,2,4], 6)

Popularity 7/10 Helpfulness 3/10 Language javascript

Source: Grepper

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

two sum js

Comment

var twoSum = function(nums, target) {
let mapping = {}

  for(let i = 0; i < nums.length; i++) {
      if(target - nums[i] in mapping) {
         return [mapping[target-nums[i]],i]
      } else {
         mapping[nums[i]] = i
      }
  }
  return []
};

Popularity 7/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

two sum js

Comment

var sumDigit = function(nums, target) {
    const indexArr = [];
    let i = 0
    
    while(true) {
      const current = nums[i];
      const j = indexArr[current];

      if(j !== undefined) return [i, j];
      indexArr[target - current] = i; 
      i++
    }
};

sumDigit([3,2,4], 6)

Popularity 7/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

two sum js

Comment

function sumDigit(nums, target) {
  let mapping = {}

  for(let i = 0; i < nums.length; i++) {
    let n = nums[i]

    if(mapping[target - n] != null) return [ mapping[target - n], i ]
    mapping[n] = i
  }
}

sumDigit([3,2,4], 6)

Popularity 7/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

two sum js

Comment

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

// Naive Approach: Brute Force | O(N^2) | O(1)
const brute = (nums, target) => {
  for (let i = 0; i < nums.length - 1; i++) {
    for (let j = i+1; j < nums.length; j++) {
      if (nums[i]+nums[j] === target) return [i,j];
    }
  }
  return []
};

// Memoization: HashMap | O(N) | O(N)
const memoization = (nums, target) => {
  const memo = {}; 
  for (let i = 0; i < nums.length; i++) {
    if (Number.isInteger(memo[nums[i]])) return [memo[nums[i]], i];
    else memo[target - nums[i]] = i;
  }
  return []; 
};

Popularity 7/10 Helpfulness 1/10 Language javascript

Source: leetcode.com

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

two sum js

Comment

function twoSum(nums, target) {
    const viewed = []; // access by index is faster that Map
    for(let i=0; ;i++){ //according to task description - solution is always present - no need to check <.length or something like this
        const current = nums[i];
        const j = viewed[current];
        if(j !== undefined){
            return [i, j];
        }

        viewed[target - current] =  i; 
    }
};

Popularity 6/10 Helpfulness 1/10 Language javascript

Source: leetcode.com

Tags: javascript sum

Link to this answer
Share Copy Link

Contributed on Sep 10 2022

Restu Wahyu Saputra

0 Answers Avg Quality 2/10

2 sum js solution

Contents

More Related Answers

2 sum js solution

Closely Related Answers

two sum javascript

two sum javascript solution

two sum js

two sum js

two sum js

two sum js

two sum js

two sum js

two sum js

two sum js

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.