Search⌘ K
AI Features

Solution: Candy

Explore how to use a greedy algorithm with two passes to distribute candies to children according to their ratings. Understand the step-by-step process that ensures each child receives at least one candy and children with higher ratings than their neighbors get more, while minimizing the total candies given.

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