René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/4sum","name":"#18 - 4Sum - LeetCode JavaScript Solutions","description":"Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:  0 <= a,...","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 fourSum = function(nums, target) {\n  const result = [];\n\n  nums.sort((a, b) => a - b);\n\n  for (let i = 0; i < nums.length - 3; i++) {\n    for (let j = i + 1; j < nums.length - 2; j++) {\n      let high = nums.length - 1;\n      let low = j + 1;\n\n      while (low < high) {\n        const sum = nums[i] + nums[j] + nums[low] + nums[high];\n\n        if (sum === target) {\n          result.push([nums[i], nums[j], nums[low], nums[high]]);\n          while (nums[low] === nums[low + 1]) {\n            low++;\n          }\n          while (nums[high] === nums[high - 1]) {\n            high--;\n          }\n          low++;\n          high--;\n        } else if (sum < target) {\n          low++;\n        } else {\n          high--;\n        }\n      }\n      while (nums[j] === nums[j + 1]) {\n        j++;\n      }\n    }\n    while (nums[i] === nums[i + 1]) {\n      i++;\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 18, #18 - 4Sum, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}