René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/two-sum","name":"#1 - Two Sum - LeetCode JavaScript Solutions","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 assu...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @param {number} target\n * @return {number[]}\n */\nvar twoSum = function(nums, target) {\n  const map = new Map();\n\n  for (let i = 0; i < nums.length; i++) {\n    const diff = target - nums[i];\n\n    if (map.has(diff)) {\n      return [map.get(diff), i];\n    }\n\n    map.set(nums[i], i);\n  }\n};","keywords":"LeetCode 1, #1 - Two Sum, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}