Given a string, partition it such that every substring is a palindrome. Return all possible palindrome partitioning.
Sample Output:
[["a","a","b"],["aa","b"]]
Hints
Hint 1
Use backtracking to explore all partitions
Hint 2
Check if current substring is palindrome before recursing
Hint 3
Build partitions incrementally
