Majority Element Python Solution with Tests

lcpy gen -n 169   # by problem number
lcpy gen -s majority_element   # by problem name

Input: nums = [3,2,3]
Output: 3

Input: nums = [2,2,1,1,1,2,2]
Output: 2

class Solution:
    # Time: O(n)
    # Space: O(1)
    # Boyer-Moore Voting Algorithm
    def majority_element(self, nums: list[int]) -> int:
        candidate = 0
        count = 0

        for num in nums:
            if count == 0:
                candidate = num
            count += 1 if num == candidate else -1

        return candidate