LeetCode 169 | Majority Element | Python Boyer-Moore Voting Algorithm | AlgoYogi

Welcome to AlgoYogi! 🚀 Start Your Smart Coding Prep at 👉 https://algoyogi.io In this video, we solve **LeetCode 169: Majority Element** using Python and the elegant **Boyer-Moore Voting Algorithm**. Problem Summary: You are given an integer array `nums` where a majority element appears more than n / 2 times. The problem guarantees that such an element always exists. Algorithm Overview: - Initialize a **candidate** and a **count** starting at zero. - For each number in the array: • If count is zero, set current number as the candidate. • If the current number matches the candidate, increment count. • Otherwise, decrement count. - At the end, the remaining candidate is the majority element. This approach runs in **O(n)** time and uses **O(1)** space. It's elegant, efficient, and widely used in interviews. --- ### ⏱ Timestamps 0:00 Introduction 0:20 Problem Statement 0:40 Brute-Force 6:30 Boyer-Moore Voting Logic 15:00 Python Code Walkthrough 17:00 Time & Space Complexity --- ### Why Watch? - Learn a powerful, linear-time algorithm for a classic problem. - No extra memory required—just two variables! - Strong interview proof: pairing and cancellation logic ensures the majority survives. #LeetCode #MajorityElement #Python #AlgoYogi #BoyerMoore