leetcode 169 : majority element : python solution

LeetCode problem 169, "Majority Element," asks you to find the element that appears more than ⌊n / 2⌋ times in an array of size `n`. The task is to identify this majority element efficiently. A common approach is the Boyer-Moore Voting Algorithm, which works in O(n) time and O(1) space. It involves two passes: one to find a candidate for the majority element and another to verify it. The problem tests your ability to manipulate arrays and optimize for both time and space complexity. It's a popular interview question and helps develop skills for handling array-based problems efficiently.