Candy
Understand how to apply greedy algorithms to distribute candies to children based on their ratings. Learn to ensure that each child gets at least one candy and children with higher ratings than their neighbors receive more. This lesson helps you identify optimization using greedy strategies to minimize the total candies distributed.
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 than their neighbors.
Determine the minimum total number of candies you must distribute to satisfy the above conditions.
Constraints:
...