We can use a LinkedHashMap which preserves the order of insertion. After one full scan and storing the counts (if need be), the first item in the hash map with frequency 1 will be the first unrepeated character