Implemented Palindrome Partitioning using Backtracking algorithm (TheAlgorithms#1591)

Trikcode · appgurueu · web-flow · commit 1b66d86bd743 · 2023-11-28T09:58:32.000+05:30
* Implemented Palindrome Partitioning using Backtracking algorithm

* fix:Updated palindromePartition algorithm

* code clean up

* Rephrase doc comment &amp; move to appropriate function

---------

Co-authored-by: Lars Müller &lt;34514239+appgurueu@users.noreply.github.com&gt;
diff --git a/Recursive/PalindromePartitioning.js b/Recursive/PalindromePartitioning.js
@@ -0,0 +1,30 @@
+import { palindrome } from './Palindrome'
+
+/*
+ * Given a string s, return all possible palindrome partitionings of s.
+ * A palindrome partitioning partitions a string into palindromic substrings.
+ * @see https://www.cs.columbia.edu/~sedwards/classes/2021/4995-fall/proposals/Palindrome.pdf
+ */
+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
diff --git a/Recursive/test/PalindromePartitioning.test.js b/Recursive/test/PalindromePartitioning.test.js
@@ -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']])
+  })
+})
