@@ -5,5 +5,4 @@
 + Letter Combination of a Phone Number [LeetCode #17](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)
 + Generate Parentheses [LeetCode #22](https://leetcode.com/problems/generate-parentheses/)
 + Combination Sum [LeetCode #39](https://leetcode.com/problems/combination-sum/)
-+ Wildcard Matching [LeetCode #44](https://leetcode.com/problems/wildcard-matching/)
-+ N-Queens [LeetCode #51](https://leetcode.com/problems/n-queens/)
++ Wildcard Matching [LeetCode #44](https://leetcode.com/problems/wildcard-matching/)
@@ -0,0 +1,16 @@
+const helper = function(ret, temp, index, nums) {
+    for (let i = index+1; i < nums.length; i++) {
+        const newTemp = [...temp, nums[i]];
+        ret.push(newTemp);
+        helper(ret, newTemp, i, nums);
+    }
+}
+
+var subsets = function(nums) {
+    // Recursively
+    const ret = [[]];
+    helper(ret, [], -1, nums);
+    return ret;
+};
+
+console.log(subsets([1,2,3]))