My_solution

leetcode_131.py

@@ -0,0 +1,21 @@
+class Solution:
+    def partition(self, s: str) -> List[List[str]]:
+        res = []
+
+        def is_palindrome(sub):
+            return sub == sub[::-1]
+
+        def dfs(start, path):
+            if start == len(s):
+                res.append(path[:])
+                return
+
+            for end in range(start + 1, len(s) + 1):
+                sub = s[start:end]
+                if is_palindrome(sub):
+                    path.append(sub)
+                    dfs(end, path)
+                    path.pop()  # backtrack
+
+        dfs(0, [])
+        return res

leetcode_78.py

@@ -0,0 +1,6 @@
+class Solution:
+    def subsets(self, nums: List[int]) -> List[List[int]]:
+        res = [[]]
+        for x in nums:
+            res += [r + [x] for r in res]
+        return res