Given a string s, partition s such that every substring of the partition is a palindrome.
Return all possible palindrome partitioning of s.
For example, given s = "aab" ,
Return
Return
[ ["aa","b"], ["a","a","b"] ]<Solution>
[ ["aa","b"], ["a","a","b"] ]<Solution>
X X X X X O O X X X O X X O X X
X X X X X X X X X X X X X O X X<Solution>
1 / \ 2 3
[
["hit","hot","dot","dog","cog"],
["hit","hot","lot","log","cog"]
]