Solution: Candy
Explore how to apply a two-pass greedy approach to distribute candies based on children's ratings. Understand how to ensure each child gets at least one candy and those with higher ratings than their neighbors receive more, all while minimizing the total number of candies distributed. This lesson demonstrates the algorithm's logic and efficiency.
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 than their neighbors.
Determine the minimum total number of candies you must distribute to satisfy the above conditions.
Constraints:
ratings.length...