Leetcode 150 | Day 4: Majority Element - Naive vs. Optimized

Leetcode 169 asks us to identify the majority element in a given array. The majority element is defined as the element that appears more than n / 2 times. We are told that we can assume such an element always exists.

Source: [Dev.to](https://dev.to/afuji/leetcode-150-day-4-majority-element-naive-vs-optimized-eo6)