René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/permutation-sequence","name":"#60 - Permutation Sequence - LeetCode JavaScript Solutions","description":"The set [1, 2, 3, ..., n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the f...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} n\n * @param {number} k\n * @return {string}\n */\nvar getPermutation = function(n, k) {\n  const factorial = [1];\n  for (let i = 1; i < n; i++) {\n    factorial[i] = factorial[i-1] * i;\n  }\n\n  const values = new Array(n).fill(0).map((_, i) => i + 1);\n  let result = '';\n  k--;\n\n  for (let i = n - 1; i >= 0; i--) {\n    const index = Math.floor(k / factorial[i]);\n    k = k % factorial[i];\n    result += values[index];\n    values.splice(index, 1);\n  }\n\n  return result;\n};","keywords":"LeetCode 60, #60 - Permutation Sequence, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}