Palindrome partitioning
Mediumbacktrackingstringdynamic programming
Split s into contiguous parts that are each a palindrome. Return every possible split (the order of the splits doesn't matter, but parts within a split follow the word's order).
Example 1
Input: s = "aab" Output: [["a","a","b"],["aa","b"]]
Example 2
Input: s = "a" Output: [["a"]]
Constraints
- 1 ≤ s.length ≤ 12
- Lowercase letters
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {string} s
* @return {string[][]}
*/
function partitionPalindromes(s) {
}