René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/factor-combinations","name":"#254 - Factor Combinations - LeetCode JavaScript Solutions","description":"Numbers can be regarded as the product of their factors. For example, 8 = 2 x 2 x 2 = 2 x 4. Given an integer n, return all possible combina...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} n\n * @return {number[][]}\n */\nvar getFactors = function(n) {\n  const result = [];\n  findFactors(n, 2, []);\n  return result;\n\n  function findFactors(currentNum, start, combination) {\n    for (let i = start; i * i <= currentNum; i++) {\n      if (currentNum % i === 0) {\n        const nextNum = currentNum / i;\n        if (nextNum >= i && nextNum < currentNum) {\n          result.push([...combination, i, nextNum]);\n          findFactors(nextNum, i, [...combination, i]);\n        }\n      }\n    }\n  }\n};","keywords":"LeetCode 254, #254 - Factor Combinations, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}