From the website called interviewbit.com, I find an interesting problem called “First non-repeating character in a stream of characters”, by doing some research on this problem, I will provide a queue-based solution with time complexity O(n).
Problem Description:
Given a string A denoting a stream of lowercase alphabets. …
