René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/3sum","name":"#15 - 3Sum - LeetCode JavaScript Solutions","description":"Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j]...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number[][]}\n */\nvar threeSum = function(nums) {\n  const result = [];\n  nums.sort((a, b) => a - b);\n\n  for (let i = 0; i < nums.length - 2; i++) {\n    if (i > 0 && nums[i] === nums[i - 1]) continue;\n    let j = i + 1;\n    let k = nums.length - 1;\n    while (j < k) {\n      const sum = nums[i] + nums[j] + nums[k];\n      if (!sum) {\n        result.push([nums[i], nums[j], nums[k]]);\n        j++;\n        k--;\n        while (j < k && nums[j] === nums[j - 1]) {\n          j++;\n        }\n        while (j < k && nums[k] === nums[k + 1]) {\n          k--;\n        }\n      } else {\n        sum < 0 ? j++ : k--;\n      }\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 15, #15 - 3Sum, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}