You are given a $0$ indexed array of positive integers tasks, where tasks[i] denotes the type of the $i^{ ext{th}}$ task that must be completed in order. You are also given an integer space, which represents the minimum number of days that must intervene between any two tasks of the same type.

On each day, you can either execute the next task in tasks or take a break.

Return the minimum number of days required to complete all the tasks.

Constraints:

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

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

• $1 \leq$ space $\leq$ tasks.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.