Given an integer array candies of length n, where candies[i] represents the number of candies the $i^{th}$ kid currently has, and an integer extraCandies, determine whether each kid can have the greatest number of candies after receiving all extraCandies.

Return a boolean array result of length n, where result[i] is TRUE if the $i^{th}$ kid can have the greatest number of candies after receiving all extraCandies, and FALSE otherwise.

Note: Multiple kids can have the greatest number of candies at the same time.

Constraints:

• n == candies.length

• $2 \leq$ n $\leq 10^2$

• $1 \leq$ candies[i] $\leq 10^2$

• $1 \leq$ extraCandies $\leq 50$

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.