Search⌘ K
AI Features

Solution: Candy

Explore the greedy algorithm approach to distribute candies fairly among children based on their ratings. Understand the two-pass technique that ensures each child gets at least one candy and those with higher ratings receive more than their neighbors, while minimizing the total candies distributed.

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 ...