// Majority Element — EASY

// Category: array

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.

Example: nums = [3, 2, 3]

Output: 3