Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Candy

Explore how to apply greedy algorithm patterns to distribute candies to children based on their ratings. Understand the two-pass approach that ensures minimum total candies while satisfying constraints. This lesson helps you master optimal solutions with linear time complexity for rating-based allocation problems.

We'll cover the following...

Statement

You are given an array ratings where ratings[i] represents the rating of the i-th child standing in a line. Your task is to distribute candies to each child based on the following rules:

  1. Every child must receive at least one candy.

  2. Children with a higher rating get more candies ...