You are given an integer array nums and two integers k and numOperations.

You can perform at most numOperations operations on the array. In each operation, you choose an index i that has not been chosen in any previous operation and add an integer from the range $[ -`k`, `k` ]$ to nums[i].

Return the maximum possible frequency of any element in nums after performing at most numOperations operations.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• $0 \leq$ k $\leq 10^9$

• $0 \leq$ numOperations $\leq$ nums.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.