LeetCode 387 | First Unique Character in a String | Python Counting and First Pass | AlgoYogi

Welcome to AlgoYogi! 🚀 Start Your Smart Coding Prep at 👉 https://algoyogi.io We solve LeetCode 387: First Unique Character in a String using Python with a simple two-pass approach. Idea: count frequency of each character, then scan once more to find the first index whose count is exactly 1. If none exists, return minus one. 👉 Problem Link: https://leetcode.com/problems/first-unique-character-in-a-string/description/ --- ### ⏱ Timestamps 0:00 Introduction 0:20 Problem Statement 0:30 Counting Approach 5:00 Python Code Walkthrough 6:30 Time and Space Complexity --- ### 💡 Why Watch? - Clean O(n) time, O(1) extra space for fixed alphabets - Works great with Python Counter or an array of size 26 - Interview staple for frequency counting and index scanning #LeetCode #FirstUniqueCharacter #Python #AlgoYogi #HashMap #Counting