{"id":"first-unique-char-two-pass-frequency","text":"The first-unique-character solution uses a two-pass approach: pass 1 builds a complete `Counter` over the entire string, pass 2 scans in original order to find the first character with count exactly 1.","truth_value":"IN","source":"entries/2026/06/06/first-unique-character-in-a-string-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"first-unique-char-two-pass-frequency","truth_value":"IN","reason":"premise"}]}}