Medium

Quiz

#131 Palindrome Partitioning

APPROACH

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"]]

1 of 4

What is the optimal approach for this problem?