ME

Palindrome Partitioning

Given a string s, partition it into one or more plaiendromes. Return all possible palindrome partitions.

Example 1:

Input:aab

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

Example 2:

Input:a

Output:[["a"]]

Example 3:

Input:abba

Output:[["a","b","b","a"], ["a","bb","a"], ["abba"]]

Constraints:

The string will come from the English alphabet only and will have lowercase letters only.
1 <= s.length <= 20

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Palindrome Partitioning

MediumMed•212 views

Given a string s, partition it into one or more plaiendromes. Return all possible palindrome partitions.

Example 1:

Input:aab

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

Example 2:

Input:a

Output:[["a"]]

Example 3:

Input:abba

Output:[["a","b","b","a"], ["a","bb","a"], ["abba"]]

Constraints:

The string will come from the English alphabet only and will have lowercase letters only.
1 <= s.length <= 20

MediumMed•212 views

Time Complexity

Space Complexity

F

Asked at

Flipkart Grid 8.0

AD

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

GitHub LinkedIn

Up Next

F

Data Frame - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

F

Megastore Partitioning - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

F

Marathon Checkpoints - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

F

SQL - Flipkart Grid 8.0

Flipkart Grid 8.0 • Pending

F

Data Frame

Flipkart Grid 8.0 • Pending

Last updated Jul 2026