Given a string S consisting of lowercase Latin Letters. Find the first non-repeating character in S.
Input: S = hello Output: h Explanation: In the given string, the first character which is non-repeating is h, as it appears first and there is no other 'h' in the string.
Input: S = zxvczbtxyzvy Output: c Explanation: In the given string, 'c' is the character which is non-repeating.
You only need to complete the function nonrepeatingCharacter() that takes string S as a parameter and returns the character. If there is no non-repeating character then return '$' .
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Number of distinct characters).
Note: N = |S|
1 <= N <= 103
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes