#131
Palindrome Partitioning
medium · verified · 73.7% accepted · 14,202 likes · top 84%
string · dynamic programming · backtracking
Description
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"]]
Example 2:
Input: s = "a"
Output: [["a"]]
Solution