René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/combinations","name":"#77 - Combinations - LeetCode JavaScript Solutions","description":"Given two integers n and k, return all possible combinations of k numbers out of the range [1, n]. You may return the answer in any order. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} n\n * @param {number} k\n * @return {number[][]}\n */\nvar combine = function(n, k) {\n  const result = [];\n  backtrack(result, n, k);\n  return result;\n};\n\nfunction backtrack(result, n, k, combination = [], offset = 1) {\n  if (combination.length === k) {\n    result.push(combination);\n  } else {\n    while (offset <= n) {\n      backtrack(result, n, k, [...combination, offset], ++offset);\n    }\n  }\n}","keywords":"LeetCode 77, #77 - Combinations, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}