Trikcode
diff --git a/‎Backtracking/PalindromePartitioning.js
Lines changed: 0 additions & 46 deletions b/‎Backtracking/PalindromePartitioning.js
Lines changed: 0 additions & 46 deletions
diff --git a/‎Backtracking/tests/PalindromePartitioning.test.js
Lines changed: 0 additions & 29 deletions b/‎Backtracking/tests/PalindromePartitioning.test.js
Lines changed: 0 additions & 29 deletions
diff --git a/‎Recursive/PalindromePartitioning.js
Lines changed: 74 additions & 0 deletions b/‎Recursive/PalindromePartitioning.js
Lines changed: 74 additions & 0 deletions
diff --git a/‎Recursive/test/PalindromePartitioning.test.js
Lines changed: 12 additions & 0 deletions b/‎Recursive/test/PalindromePartitioning.test.js
Lines changed: 12 additions & 0 deletions
@@ -0,0 +1,74 @@
+/*
+ * Problem Statement: Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
+ * what is palindrome partitioning?
+ * - Palindrome partitioning means, partitioning a string into substrings such that every substring is a palindrome.
+ * Reference to know more about palindrome partitioning:
+ * - https://www.cs.columbia.edu/~sedwards/classes/2021/4995-fall/proposals/Palindrome.pdf
+ */
+
+// class PalindromePartitioning {
+//   partition(s) {
+//     const result = []
+//     this.backtrack(s, [], result)
+//     return result
+//   }
+
+//   backtrack(s, path, result) {
+//     if (s.length === 0) {
+//       result.push([...path])
+//       return
+//     }
+
+//     for (let i = 0; i < s.length; i++) {
+//       const prefix = s.substring(0, i + 1)
+//       if (this.isPalindrome(prefix)) {
+//         path.push(prefix)
+//         this.backtrack(s.substring(i + 1), path, result)
+//         path.pop()
+//       }
+//     }
+//   }
+
+//   isPalindrome(s) {
+//     let start = 0
+//     let end = s.length - 1
+//     while (start < end) {
+//       if (s.charAt(start) !== s.charAt(end)) {
+//         return false
+//       }
+//       start++
+//       end--
+//     }
+//     return true
+//   }
+// }
+
+// export default PalindromePartitioning
+
+// use a function instead of class and reuse existing palindrome function not isPalindrome function
+
+import { palindrome } from './Palindrome'
+
+const partitionPalindrome = (s) => {
+  const result = []
+  backtrack(s, [], result)
+  return result
+}
+
+const backtrack = (s, path, result) => {
+  if (s.length === 0) {
+    result.push([...path])
+    return
+  }
+
+  for (let i = 0; i < s.length; i++) {
+    const prefix = s.substring(0, i + 1)
+    if (palindrome(prefix)) {
+      path.push(prefix)
+      backtrack(s.substring(i + 1), path, result)
+      path.pop()
+    }
+  }
+}
+
+export default partitionPalindrome
@@ -0,0 +1,12 @@
+import partitionPalindrome from '../PalindromePartitioning'
+
+describe('Palindrome Partitioning', () => {
+  it('should return all possible palindrome partitioning of s', () => {
+    expect(partitionPalindrome('aab')).toEqual([
+      ['a', 'a', 'b'],
+      ['aa', 'b']
+    ])
+    expect(partitionPalindrome('a')).toEqual([['a']])
+    expect(partitionPalindrome('ab')).toEqual([['a', 'b']])
+  })
+})