You are given an integer candies representing the total number of candies available, and an integer num_people representing the number of people standing in a line.

The candies are distributed in rounds:
We give $1$ candy to the first person, $2$ candies to the second person, and continue this pattern until giving num_people candies to the last person.
Then, we return to the first person and give num_people $+ 1$ candies to the first person, num_people $+ 2$ candies to the second person, and so on.
This process continues until we run out of candies. If there are not enough candies remaining to satisfy the required amount for the current person, that person receives all the remaining candies, and the distribution ends.

Return an array of length num_people representing the total number of candies each person receives.

Constraints:

• $1 \leq$ candies $\leq 10^9$

• $1 \leq$ num_people $\leq 1000$

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.