Add solution #78

JoshCrozier · JoshCrozier · commit 78e9815d4164 · 2023-01-05T17:47:23.000-06:00
diff --git a/0078-subsets.js b/0078-subsets.js
@@ -0,0 +1,27 @@
+/**
+ * 78. Subsets
+ * https://leetcode.com/problems/subsets/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums of unique elements, return all possible subsets (the power set).
+ *
+ * The solution set must not contain duplicate subsets. Return the solution in any order.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number[][]}
+ */
+var subsets = function(nums) {
+  const result = [];
+  dfs([], 0);
+
+  function dfs(subset, start) {
+    result.push(subset);
+    for (let index = start; index < nums.length; index++) {
+      dfs([...subset, nums[index]], index + 1);
+    }
+  }
+
+  return result;
+};
diff --git a/README.md b/README.md
@@ -59,6 +59,7 @@
 73|[Set Matrix Zeroes](./0073-set-matrix-zeroes.js)|Medium|
 74|[Search a 2D Matrix](./0074-search-a-2d-matrix.js)|Medium|
 77|[Combinations](./0077-combinations.js)|Medium|
+78|[Subsets](./0078-subsets.js)|Medium|
 83|[Remove Duplicates from Sorted List](./0083-remove-duplicates-from-sorted-list.js)|Easy|
 88|[Merge Sorted Array](./0088-merge-sorted-array.js)|Easy|
 94|[Binary Tree Inorder Traversal](./0094-binary-tree-inorder-traversal.js)|Easy|
