Your question is First Non-Repeated Character. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Given a string s, return the first character that appears exactly once in the string. If no such character exists, return an empty string "". The algorithm should preserve the original order of characters when deciding which unique character is first.
def first_non_repeated_char(s):