1431. Kids With the Greatest Number of Candies

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 i^th 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 i^th 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.

Example 1:

Input: candies = [2,3,5,1,3], extraCandies = 3
Output: [true,true,true,false,true]
Explanation: If you give all extraCandies to:
- Kid 1, they will have 2 + 3 = 5 candies, which is the greatest among the kids.
- Kid 2, they will have 3 + 3 = 6 candies, which is the greatest among the kids.
- Kid 3, they will have 5 + 3 = 8 candies, which is the greatest among the kids.
- Kid 4, they will have 1 + 3 = 4 candies, which is not the greatest among the kids.
- Kid 5, they will have 3 + 3 = 6 candies, which is the greatest 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.
Kid 1 will always have the greatest number of candies, even if a different kid is given the extra candy.

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

Click to open Hints

Use greedy approach. For each kid check if candies[i] + extraCandies ≥ maximum in Candies[i].

Solution:

GoRustJava

package main

func kidsWithCandies(candies []int, extraCandies int) []bool {
	max := 0

	for _, candy := range candies {
		if candy > max {
			max = candy
		}
	}

	result := make([]bool, len(candies))

	for i, candy := range candies {
		if candy+extraCandies >= max {
			result[i] = true
		}
	}

	return result
}

impl Solution {
    pub fn kids_with_candies(candies: Vec<i32>, extra_candies: i32) -> Vec<bool> {
        let mut max = 0;

        for i in 0..candies.len() {
            if candies[i] > max {
                max = candies[i];
            }
        }

        let mut result = Vec::new();

        for i in 0..candies.len() {
            if candies[i] + extra_candies >= max {
                result.push(true);
            } else {
                result.push(false);
            }
        }

        result
    }
}

java

import java.util.ArrayList;
import java.util.List;

class Solution {
  public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
    int max = 0;

    for (int candy : candies) {
      if (candy > max) {
        max = candy;
      }
    }

    List<Boolean> res = new ArrayList<>();

    for (int i = 0; i < candies.length; i++) {
      if (candies[i] + extraCandies >= max) {
        res.add(true);
      } else {
        res.add(false);
      }
    }

    return res;
  }
}

1431. Kids With the Greatest Number of Candies #

Problem Statement #

Solution: #

... #

1431. Kids With the Greatest Number of Candies

Problem Statement

Solution:

...