Solution: Candy
Explore how to apply a two-pass greedy algorithm to assign candies to children based on their ratings. This lesson helps you understand ensuring each child receives at least one candy and that higher-rated children get more than neighbors. You will learn to optimize candy distribution with time and space efficiency.
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 ...