You are given a string 'STR' of lowercase English alphabets. You need to find the repeated character present first in the string.
Example:If the string is: “abccba”, then the first repeated character is ‘c’, but the repeated character that is present first in the string is ‘a’. You need to print ‘a’.
Note:
Keep in mind that you need to print the repeated character that is present first in the string and not the first repeating character.
The first line contains a single integer ‘T’ representing the number of test cases.
The first line of each test case will contain a string ‘S’, which denotes the string of lowercase English alphabets.
Output Format:
For each test case, print the repeated character that occurs first in the string. If no repeated character is found then print ‘%’.
Output for every test case will be printed in a separate line.
Note:
You don't need to print anything. It has already been taken care of.
You just need to complete the “repeatedCharacter” function that returns the first repeating character in the string. In case there is no repeating character then return “%”.
1 <= T <= 200
0 <= size of S <= 10000
where 'S’ is the string of lowercase English alphabets.
Time limit: 1 sec
2
abccba
codingninjas
a
i
In the first test case,
The repeated character that occurs first in the string is ‘a’
In the second test case,
The repeated character that occurs first in the string is ‘i’
3
hello
helloh
abc
l
h
%
In the first test case,
The repeated character that occurs first in the string is ‘l’
In the second test case,
The repeated character that occurs first in the string is ‘h’
In the third test case,
There is no repeating character in the string, so print ‘%’
Can you think of comparing each character with every other character?
The basic approach is to check each character in the rest of the string and if it is repeated then simply print it.
The steps are as follows:
O(N ^ 2), Where ‘N’ is the size of the string.
Since we are traversing each pair of characters in the given string using a nested loop running in O(N) time each. So, the time complexity will be O(N ^ 2).
O(1)
Since no extra space is required. So, space complexity will be O(1).