Dsa
Recursion
Medium
Generate Palindromic Substrings
Given a string, find all possible substrings that are palindromic. A palindrome reads the same forwards and backwards. The output should include only unique substrings.
Input format:
- A single string s (1 <= len(s) <= 100).
Output format:
- Print each unique palindromic substring on a new line.
Example:
Input:
aabaa
Output:
aa
aba
b
aba
b
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