BinarySearch 0058 High Frequency

Problem statement

https://binarysearch.com/problems/High-Frequency/

Solution

Just use counter.

Complexity

It is O(n) for time and space.

Code

class Solution:
    def solve(self, nums):
        if not nums: return 0
        return max(Counter(nums).values())