Question bank › Backtracking
Dsa Backtracking Medium

Palindrome Partitioner

Given a string, partition it such that every substring of the partition is a palindrome. Return all possible palindrome partitions of the string. Each partition is represented as a list of substrings. Input format: A single string. Output format: A list of lists of substrings. Example: Input: racecar Output: [['r', 'a', 'c', 'e', 'c', 'a', 'r'], ['r', 'aceca', 'r'], ['racecar']]

Key concepts

backtrackingstringspalindrome

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
Part of InterviewLab's verified interview question bank. We show the prompt and concepts to practise with — never a copy-paste solution.