{leetcode}/problems/palindrome-partitioning/[LeetCode - 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:
Input: "aab" Output: [ ["aa","b"], ["a","a","b"] ]
link:{sourcedir}/_0131_PalindromePartitioning.java[role=include]