### LeetCode - Kids With the Greatest Number of Candies Solution - The Coding Shala

Home >> LeetCode >> Kids with the Greatest Number of Candies

In this post, we will learn how to solve LeetCode's Kids With the Greatest Number of Candies problem and will implement its solution in Java.

## Kids With the Greatest Number of Candies

Given the array candies and the integer extra candies, where candies[i] represents the number of candies that the ith kid has. For each kid check if there is a way to distribute extra candies among the kids such that he or she can have the greatest number of candies among them. Notice that multiple kids can have the greatest number of candies.

Example 1:

Input: candies = [2,3,5,1,3], extraCandies = 3

Output: [true,true,true,false,true]

Explanation:

Kid 1 has 2 candies and if he or she receives all extra candies (3) will have 5 candies

Kid 2 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids.

Kid 3 has 5 candies and this is already the greatest number of candies among the kids.

Kid 4 has 1 candy and even if he or she receives all extra candies will only have 4 candies.

Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids.

Example 2:

Input: candies = [4,2,1,1,2], extraCandies = 1

Output: [true,false,false,false,false]

Explanation: There is only 1 extra candy, therefore only kid 1 will have the greatest number of candies among the kids regardless of who takes the extra candy.

Practice this problem on LeetCode (Click Here).

## Kids With the Greatest Number of Candies Java Solution

**Approach 1:**

First, find the max in the array, now compare each element after adding the extra candies with the max number if its equal or greater then the max then return true else false.

Java Program:

class Solution { public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) { int max = -1; for(int i=0; i<candies.length; i++) { if(candies[i] > max) max = candies[i]; } List<Boolean> ans = new ArrayList<>(); for(int i=0; i<candies.length; i++) { if(candies[i] + extraCandies >= max) { ans.add(true); } else ans.add(false); } return ans; } }

**Other Posts You May Like**- LeetCode - Running Sum of 1d Array
- LeetCode - Climbing Stairs
- LeetCode - Degree of an Array
- LeetCode - Contains Duplicate
- LeetCode - Next Greater Element

## Comments

## Post a Comment