Your question is First Non-Repeating 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 when scanning from left to right. If no such character exists, return an empty string "". Write a Python function that solves this efficiently and be prepared to analyze its time complexity.
def first_non_repeating_char(s):