Solution: Candy
Understand how to apply greedy techniques in the Candy distribution problem. Learn to use a two-pass approach to assign candies efficiently, ensuring children with higher ratings than neighbors receive more while minimizing total candies. This lesson develops skills in optimization using greedy algorithms and analyzing time and space tradeoffs.
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 ...