twoSum best Time Complexity
123456789101112131415
const twoSum = function(nums, target) {
const history = new Map();
for(let i=0; i<nums.length; i++){
let complement = target - nums[i];
if(history.has(complement)){
return [ history.get(complement) , i]
}
history.set(nums[i], i);
}
};
console.log(twoSum([1,13,15,2,7], 9))
JavaScript
INFO