Majority Element (Boyer-Moore Voting Algorithm)

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 in the array. ### Constraints - `n == nums.length` - `1 <= n <= 10^5` - `-10^9 <= nums[i] <= 10^9` ### Input Format A single line of space-separated integers representing `nums`. ### Output Format Print a single integer representing the majority element.