mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-06 01:18:23 +08:00
Implemented Palindrome Partitioning using Backtracking algorithm (#1591)
* Implemented Palindrome Partitioning using Backtracking algorithm * fix:Updated palindromePartition algorithm * code clean up * Rephrase doc comment & move to appropriate function --------- Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
This commit is contained in:

committed by
GitHub

parent
39d01138ec
commit
1b66d86bd7
12
Recursive/test/PalindromePartitioning.test.js
Normal file
12
Recursive/test/PalindromePartitioning.test.js
Normal file
@ -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']])
|
||||
})
|
||||
})
|
Reference in New Issue
Block a user