Merge pull request #989 from sujijava/main

sujioh/2024-07-26-permutations.py

@@ -0,0 +1,12 @@
+class Solution:
+    def permute(self, num):
+        res = [[]]
+        for n in num:
+            size = len(res)
+            for _ in range(size):
+                r = res.pop(0)
+                for i in range(len(r) + 1):
+                    t = r[:]
+                    t.insert(i, n)
+                    res.append(t)
+        return res

sujioh/2024-07-27-subsets.py

@@ -0,0 +1,19 @@
+from typing import List
+
+
+class Solution:
+    def subsets(self, nums: List[int]) -> List[List[int]]:
+        res = []
+        subset = []
+
+        def dfs(i):
+            if i == len(nums):
+                res.append(subset.copy())
+                return
+            subset.append(nums[i])
+            dfs(i+1)
+            subset.pop()
+            dfs(i+1)
+
+        dfs(0)
+        return res