Problem of the day
1. You can print the array in any order.
2. The string 'S' only contains English alphabets and digits.
The first line contains an integer T, which denotes the number of test cases or queries to be run. Then, the T test cases follow.
The first and only line of each test case contains a string 'S', as described in the problem statement.
For each test case, print a single line containing space-separated strings denoting all possible strings by transforming, as described in the problem statement.
The output for each test case will be printed 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
1 <= |S| <= 12
Where |S| denotes the length of string 'S'.
Time Limit: 1 sec.
1
a1b
A1B A1b a1B a1b
These are the four strings that we can get after transforming every letter individually to be lowercase or uppercase.
1
0
0
There is no alphabet in the string, so we get the output same as the input string.