Frequency of the Most Frequent Element

lcpy gen -n 1838   # by problem number
lcpy gen -s frequency_of_the_most_frequent_element   # by problem name

Input: nums = [1,2,4], k = 5
Output: 3

Input: nums = [1,4,8,13], k = 5
Output: 2

Input: nums = [3,9,6], k = 2
Output: 1

class Solution:
    # Time: O(n log n) for the sort, O(n) for the sliding window
    # Space: O(1) extra beyond the in-place sort
    def max_frequency(self, nums: list[int], k: int) -> int:
        nums.sort()
        left = 0
        total = 0
        best = 0
        for right, val in enumerate(nums):
            total += val
            while (right - left + 1) * val - total > k:
                total -= nums[left]
                left += 1
            best = max(best, right - left + 1)
        return best