Skip to content

Practice Kids With the Greatest Number of Candies

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1431
LeetCode Problem

Kids With the Greatest Number of Candies

Array

Problem Statement

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.

Source: Kids With the Greatest Number of Candies on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
candies = [2,3,5,1,3], extraCandies = 3
Output
[true,true,true,false,true]

# Example 2

Input
candies = [4,2,1,1,2], extraCandies = 1
Output
[true,false,false,false,false]

# Example 3

Input
candies = [12,1,12], extraCandies = 10
Output
[true,false,true]

Constraints

n == candies.length
2 <= n <= 100
1 <= candies[i] <= 100
1 <= extraCandies <= 50

Related LeetCode Problems

Practice more problems similar to Kids With the Greatest Number of Candies.

1 Two Sum Easy4 Median of Two Sorted Arrays Hard11 Container With Most Water Medium14 Longest Common Prefix Easy15 3Sum Medium
← Previous Constrained Subsequence SumNext → Max Difference You Can Get From Changing an Integer

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free