Palindrome Partitioning

Asked byAppleGoogletiktokAmazonFacebook

Problem

Given a string, partition it so that every substring in the partition is itself a palindrome, and return all possible such partitions.

Examples

Example 1

Input:s = "aab"

Output:[["a","a","b"],["aa","b"]]

Constraints

1 <= s.length <= 16

Solve it in the editor. Sign in free to run your Python or JavaScript against test cases, get a verdict, and track your attempts.

Solve on FeatCode →

How to approach it: the Backtracking pattern

Explore a decision one choice at a time, undo it if it doesn't lead anywhere, and try the next option. It's a systematic way to generate every valid combination, permutation, or arrangement.

Look for this pattern when

The problem asks for "all possible" combinations, subsets, permutations, or valid arrangements.
A greedy or direct-formula approach doesn't work because you genuinely need to explore multiple branches.

Read the full Backtracking guide →

Video walkthroughs

Original problem on LeetCode ↗