Given an array nums of size n, return the majority element — the value that appears MORE THAN ⌊n/2⌋ times. It's guaranteed that a majority element always exists. Counting each candidate's occurrences by rescanning the array works, but it repeats a lot of counting across candidates. The Boyer-Moore Voting AlgorithmBoyer-Moore Voting AlgorithmA single-pass technique for finding a majority element: treat every element as casting a vote for or against a running candidate, and whenever the vote count hits zero, adopt the next element as the new candidate. Because a true majority element can never be fully outvoted, whatever candidate survives to the end is the answer. answers this in one O(n) pass with O(1) space, by treating the scan as an election that the majority element can never lose.