You are given an integer array tasks, where tasks[i] represents the difficulty level of a task. In each round, you can complete either $2$ or $3$ tasks of the same difficulty level.

Return the minimum number of rounds required to complete all tasks, or $-1$ if it is impossible to complete all the tasks.

Constraints:

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

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

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.