Ninja is now bored with numbers and is now playing with characters but hates when he gets repeated characters. Ninja is provided a string, and he wants to return the first unique character in the string.The string will contain characters only from the English alphabet set, i.e., ('A' - 'Z') and ('a' - 'z'). If there is no non-repeating character, print the first character of the string. If there is no non-repeating character, return the first character of the string.
1 <= T <= 10 1 <= Length of Input String <= 10^4 Time Limit: 1 sec
Sample Output 1:
2 aDcadhc AabBcC
Explanation for Sample Input 1:
Sample Input 2 :
In the first test case, ‘a’ is repeated.’ D’ is the first non-repeating character in the string, so we return it. In the second test case, all the characters are non-repeating, so we return the first character.
Sample Output 2:
2 ABcd AAAbcdb