For the given ‘STR’ = “()(()”, we can form a valid string “()()” by removing ‘(‘ at index 2 or 3.
The first line of input contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
The first and the only line of each test case contains a string ‘STR’
For each test case, print all possible unique valid strings that can be formed from ‘STR’ in a separate line.
Print the output of each test case in a separate line.
You do not need to print anything; it has already been taken care of. Just implement the given function.
1 <= ‘T’ <= 100
‘STR[i]’ = ‘(‘, ‘)’ or Lower case english alphabet
1 <= |STR| <= 2000
Where |STR| denotes the length of the given string.
Time Limit: 1 sec
Divisible Substrings
Ninja and Numbers
Longest Palindromic Substring
Cakes
1-3 Palindrome