Solution: Candy
Understand how to apply a two-pass greedy technique to distribute candies to children based on their ratings. This lesson helps you implement an efficient algorithm ensuring each child gets more candies than neighbors with lower ratings, achieving minimal total distribution.
We'll cover the following...
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:
Every child must receive at least one candy.
Children with a higher rating get more candies ...