C++

1/*
2 * Runtime: 4 ms
3 * Faster than 81.66%
4 * Memory Usage: 9.3 MB, less than 100%
5 * */
6
7class Solution {
8public:
9    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
10        vector<bool> result;
11        int _max = -1;
12        for(int i=0; i<candies.size(); ++i)
13            if (candies[i] > _max) _max = candies[i];
14        
15        for(int i=0; i<candies.size(); ++i)
16            if (candies[i] + extraCandies >= _max) result.push_back(true);
17            else result.push_back(false);
18        
19        return result;
20    }
21};

JavaScript

1/**
2 * Runtime: 76 ms, faster than 84.03% 
3 * Memory Usage: 38.7 MB, less than 7.03%
4 */
5var kidsWithCandies = function(candies, extraCandies) {
6    let max = Math.max(...candies);
7    let result = [];
8    
9    for (let i=0; i<candies.length; ++i)
10        if (candies[i] + extraCandies >= max)
11            result.push(true);
12        else
13            result.push(false);
14    return result;
15};
16
17/**
18 * Runtime: 80 ms, faster than 62.62%
19 * Memory Usage: 38.9 MB, less than 7.03%
20 */
21var kidsWithCandies = function(candies, extraCandies) {
22    let max = Math.max(...candies);
23    let result = [];
24    
25    candies.forEach(e => {
26        result.push(((e + extraCandies) >= max) ? true : false);
27    })
28    
29    return result;
30};

Ruby

1# Runtime 56ms
2# Faster than 52.02%
3# Memory Usage: 210MB, less than 76.88%
4def kids_with_candies(candies, extra_candies)
5    max = candies.max
6    result = []
7    
8    for x in candies do
9       if x + extra_candies >= max then result << true else result << false end 
10    end
11    result
12end