Palindrome Partitioning

Author: Shikha-code36

Backtracking/131-Palindrome-Partitioning.py

@@ -0,0 +1,35 @@
+'''Leetcode- https://leetcode.com/problems/palindrome-partitioning/ '''
+'''
+Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
+
+A palindrome string is a string that reads the same backward as forward.
+
+Example 1:
+
+Input: s = "aab"
+Output: [["a","a","b"],["aa","b"]]
+'''
+def partition(s):
+        res, part = [], []
+        
+        def dfs(i):
+            if i >= len(s):
+                res.append(part.copy())
+                return
+            for j in range(i, len(s)):
+                if isPali(s, i, j):
+                    part.append(s[i:j+1])
+                    dfs(j + 1)
+                    part.pop()
+        dfs(0)
+        return res
+    
+def isPali( s, l, r):
+        while l < r:
+            if s[l] != s[r]:
+                return False
+            l, r = l + 1, r - 1
+        return True
+
+#T :O(2^n)
+#S :O(n)

README.md

@@ -17,5 +17,6 @@ Check the notes for the explaination - [Notes](https://stingy-shallot-4ea.notion
     - [x] [Combination Sum II](Backtracking/40-Combination-Sum-II.py)
     - [x] [Combination Sum III](Backtracking/216-Combination-Sum-III.py)
     - [x] [Generate Parentheses](Backtracking/22-Generate-Parentheses.py)
+    - [x] [Palindrome Partitioning](Backtracking/22-Generate-Parentheses.py)