Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
Example 1
Input
s = "aab"Output
[["a","a","b"],["aa","b"]]The string can be partitioned into palindromic substrings as either
"a", "a", "b" or "aa", "b".Example 2
Input
s = "a"Output
[["a"]]The only partition of
"a" is itself, which is a palindrome.Constraints
- 1 <= s.length <= 16
- s contains only lowercase English letters.