Palindromic Substrings Problem Statement

Given a string S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.

Explanation:

A string is considered a palindrome if the reverse of the string is the same as the string itself.

Example:

Input:

S = 'abba'

Output:

'a' 'abba' 'b' 'bb'

Explanation:

All possible substrings of 'abba' are ['a', 'ab', 'abb', 'abba', 'b', 'ba', 'bb', 'bba'], out of which ['a', 'abba', 'b', 'bb'] are palindromic substrings.

Constraints:

1

Question

Palindromic Substrings Problem Statement

Given a string S, your task is to return all distinct palindromic substrings of the given string in alphabetical order.

Explanation:

A string is considered a palindrome if the reverse of the string is the same as the string itself.

Example:

Input:

S = 'abba'

Output:

'a' 'abba' 'b' 'bb'

Explanation:

All possible substrings of 'abba' are ['a', 'ab', 'abb', 'abba', 'b', 'ba', 'bb', 'bba'], out of which ['a', 'abba', 'b', 'bb'] are palindromic substrings.

Constraints:

1 <= T <= 10
1 <= |S| <= 1000
String S contains lowercase English letters only.
Time limit: 1 sec

Note:

You do not need to print anything. It has already been taken care of. Just implement the given function.

Accepted Answer

Return all distinct palindromic substrings of a given string in alphabetical order.

Iterate through all possible substrings of the given string.
Check if each substring is a palindrome.
Store distinct palindromic substrings in alphabetical order.