René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/beautiful-array","name":"#932 - Beautiful Array - LeetCode JavaScript Solutions","description":"An array nums of length n is beautiful if: nums is a permutation of the integers in the range [1, n]. For every 0 <= i < j < n, th...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} n\n * @return {number[]}\n */\nvar beautifulArray = function(n) {\n const memo = new Map();\n return helper(n);\n\n function helper(size) {\n if (memo.has(size)) return memo.get(size);\n if (size === 1) return [1];\n\n const odds = helper(Math.ceil(size / 2));\n const evens = helper(Math.floor(size / 2));\n const result = [\n ...odds.map(x => x * 2 - 1),\n ...evens.map(x => x * 2)\n ];\n\n memo.set(size, result);\n return result;\n }\n};","keywords":"LeetCode 932, #932 - Beautiful Array, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}