Back to Practice Dashboard
Python BasicsEasy
Palindromic partitions
Learn how to solve the 'Palindromic partitions' problem. This detailed resource details brute force and optimized approaches.
Problem Statement
Easy
Write a function palindromic_partitions(s) that returns all possible ways to partition the string s such that every substring in the partition is a palindrome. Return a sorted list of partitions, where each partition is a list of strings. Sort by comparing partitions lexicographically.
Constraints
- •1 <= len(s) <= 16
- •s contains only lowercase English letters
Examples
Example 1
Input
s = 'aab'
Output
[['a', 'a', 'b'], ['aa', 'b']]
Explanation
'a','a','b' are all palindromes. 'aa' is a palindrome and 'b' is a palindrome. 'aab' itself is not a palindrome.
Example 2
Input
s = 'a'
Output
[['a']]
Explanation
A single character is always a palindrome.
Example 3
Input
s = 'aba'
Output
[['a', 'b', 'a'], ['aba']]
Explanation
Both ['a','b','a'] and ['aba'] consist of only palindromic substrings.
Need a Hint?
Use simple arithmetic operators (like modulo `%`, division `//`), conditional checks, or loops to inspect number properties.
Edge Cases to Watch
- Empty list or null input variables
- Single item lists/arrays
- Extremely large input bounds causing integer or stack overflow
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.