Leetcode 169. Majority Element
Leetcode 169. Majority Element - Python Solution
Solution: https://github.com/sachinsingh3107/le...
Problem Statement: [https://leetcode.com/problems/majorit...]
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.