Kids With the Greatest Number of Candies

EasyArrays & Hashingsimulation

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

There are n kids, and candies[i] is how many candies kid i has. You also hold extra_candies spare candies. For each kid, imagine giving that kid all of the spare candies (and nobody else anything). Return a boolean array result where result[i] is true if kid i would then have at least as many candies as every other kid, ties included, and false otherwise.

Examples

Input: candies = [2,3,5,1,3], extra_candies = 3
Output: [true,true,true,false,true]
The current maximum is 5; every kid except the one with 1 candy can reach 5.
Input: candies = [4,2,1,1,2], extra_candies = 1
Output: [true,false,false,false,false]
Only the kid who already has 4 can reach the maximum of 4.
Input: candies = [12,1,12], extra_candies = 10
Output: [true,false,true]
The middle kid would reach 11, still below 12.

Constraints

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

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More simulation problems