Majority Element — C++ Coding Problem
Difficulty: easy | Category: array
Problem Description
Given an array `nums` of size `n`, return the majority element. The majority element is the element that appears **more than** `⌊n / 2⌋` times. You may assume that the majority element always exists. Hint: Boyer-Moore Voting Algorithm — maintain a candidate and count. When count hits 0, switch candidates.
Examples
Example 1
Input: nums = [3, 2, 3]
Output: 3
Example 2
Input: nums = [2, 2, 1, 1, 1, 2, 2]
Output: 2