Dsa
Recursion
Medium
Recursive Palindrome Partitioning
Given a string, partition it into substrings such that every substring is a palindrome. Return all possible palindrome partitioning of the string. The solution should be a list of lists, where each inner list represents a valid partitioning.
Input:
A single line containing the string s (1 <= len(s) <= 16).
Output:
Print all possible palindrome partitionings as lists, each partition on a new line.
Example:
Input:
racecar
Output:
['racecar']
['r', 'a', 'c', 'e', 'c', 'a', 'r']
Key concepts
recursionstringsdynamic programming
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now