Fundamentals/Partitioning A String Into Palindromes
← PrevNext →
Prereq: Backtracking
Given a string s, find all ways to partition it so that every substring is a palindrome. Return all possible palindrome partitions of s.
Examples
Example 1
Inputaab
Output
[
["aa","b"],
["a","a","b"]
]