You are given a $0$ indexed binary array team and an integer dist. A value of team[i] == 1 indicates that the person at index i is “it”, while a value of team[i] == 0 indicates that the person is not “it”.

A person who is “it” at index i can catch at most one person at index j if team[j] == 0 and $|i - j| \le$ dist. Each person who is not “it” can be caught by at most one person.

Return the maximum number of people that can be caught.

Constraints:

• $1 \le$ team.length $\le 10^5$

• $0 \le$ team[i] $\le 1$

• $1 \le$ dist $\le$ team.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.