Dsa
Recursion
Hard
Palindrome Partitioning
Given a string, partition it such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of the string. Print each partitioning on a new line.
Example Input:
aba
Example Output:
ab
a
aba
b
a
Key concepts
recursionbacktrackingstring manipulation
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