169. Majority Element - Moore's Voting Algorithm

Problem 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. Problem Link Example 1: Input: nums = [...