Problem of the day
You are given, ‘str’ = ‘AbcdEfgh’, in this string if you convert all the characters into lowercase, the string will be ‘abcdefgg’. Hence it is the answer.
The first line of input contains a single integer ‘T’, representing the number of test cases.
The first line of each test case contains a string ‘str’ representing the given string.
For each test case, print a single string representing the given string with all characters in lower case.
Print a separate line for each test case.
1 <= T <= 10
1 <= |str| <= 10^4
‘str’ will contain upper and lower case characters of the English alphabet.
Time Limit: 1 sec.
You do not need to print anything. It has already been taken care of. Just implement the given function.
2
AbcdEfgh
AAAAb
abcdefgh
aaaab
For the first test case, ‘str’ = ‘AbcdEfgh’, in this string if you convert all the characters into lowercase, the string will be ‘abcdefgg’. Hence it is the answer.
For the second test case, ‘str’ = ‘AAAAb’, in this string if you convert all the characters into lowercase, the string will be ‘aaaab’. Hence it is the answer.
2
abcde
ABCDE
abcde
abcde