Timer is Running

First non-repeating character in a stream
Submissions: 47364   Accuracy:


  Difficulty: Medium   Marks: 4

Given an input stream of N characters consisting only of lower case alphabets. The task is to find the first non repeating character, each time a character is inserted to the stream. If no non repeating element is found print -1.

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer N denoting the size of the stream. Then in the next line are x characters which are inserted to the stream.

For each test case in a new line print the first non repeating elements separated by spaces present in the stream at every instinct when a character is added to the stream, if no such element is present print -1.

1 <= T <= 200
1 <= N <= 500


a a b c
a a c

a -1 b b
a -1 c

Test Case 1: 
a a b c
The step wise first non-repeating elements are made bold:
a (print a)
a a (no non-repeating element, print -1)
a a (print b)
a a c (print b)
Result: a -1 b b

Test Case 2: a a c
(print a)
a a (no non-repeating element, print -1)
a a c (print c)
Result: a -1 c

** For More Input/Output Examples Use 'Expected Output' option **

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.