- Difficulty: Medium
- Tags: LeetCode, Medium, String, Dynamic Programming, Backtracking, leetcode-131, O(n^2) ~ O(2^n), O(n^2), LintCode, O(2^n), O(n), Easy, EPI
Problem
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"]]
Constraints:
1 <= s.length <= 16scontains only lowercase English letters.