136. Palindrome partitioning
Given a string s partition string s such that every substring of partition is palindrome. Return all possible palindrome partition of string s.
Example 1:
Input : s = "aabaa"
Output : [ [ "a", "a", "b", "a", "a"] , [ "a", "a", "b", "aa"] , [ "a", "aba", "a"] , [ "aa", "b", "a", "a"] , [ "aa", "b", "aa" ] , [ "aabaa" ] ]
Explanation : Above all are the possible ways in which the string can be partitioned so that each substring is a palindrome.
Example 2:
Input : s = "baa"
Output : [ [ "b", "a", "a"] , [ "b", "aa" ] ]
Explanation : Above all are the possible ways in which the string can be partitioned so that each substring is a palindrome.
Now Your Turn!
Pick the correct output for the given inputInput : s = "ab"
Still unsure what the problem is asking ?
Let’s go through a few more examples, step by step, to make it clearer.
Constraints:
- 1<= s.length <= 16
- s contains only lowercase English letters.