René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/subsets","name":"#78 - Subsets - LeetCode JavaScript Solutions","description":"Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate sub...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number[][]}\n */\nvar subsets = function(nums) {\n  const result = [];\n  dfs([], 0);\n\n  function dfs(subset, start) {\n    result.push(subset);\n    for (let index = start; index < nums.length; index++) {\n      dfs([...subset, nums[index]], index + 1);\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 78, #78 - Subsets, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}