Problem #147
DATA STRUCTURES
Queue based approach for first non-repeating character in a stream
Explanation
Given a stream of characters and we have to find first non repeating character each time a character is inserted to the stream. Examples: Input : a a b c Output : a -1 b b Input : a a c Output : a -1 c