Find all Palindrome Substrings
Given a string, find all substrings that are palindromes.
Statement
Given a string, find all non-single letter substrings that are palindromes.
A palindrome is a word, phrase, number, or other sequence of characters that reads the same backwards as it reads forwards.
Example
Below is an example of all possible non single-letter palindromes of string aabbbaa:
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.