Kids With the Greatest Number of Candies
The key idea
The greatest count never shrinks when you add candies to a kid, so the bar to beat is fixed: it is the current maximum of the array. Precompute that max once, then a kid qualifies exactly when candies[i] + extraCandies >= max.
Problem
There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.
Return a boolean array result of length n, where result[i] is true if, after giving the ith kid all the extraCandies, they will have the greatest number of candies among all the kids, or false otherwise.
Note that multiple kids can have the greatest number of candies.
Constraints
- 2 <= candies.length <= 100
- 1 <= candies[i] <= 100
- 1 <= extraCandies <= 50
Examples
Input: candies=[2,3,5,1,3], extraCandies=3
Output: [true,true,true,false,true]
Input: candies=[4,2,1,1,2], extraCandies=1
Output: [true,false,false,false,false]
Input: candies=[12,1,12], extraCandies=10
Output: [true,false,true]
Complexity
Time: O(n) Space: O(n)
See the full solution
- ✓Full worked approach
- ✓Reference code in 5 languages
- ✓Problem-solving tips
- ✓Step-by-step animated visualization