Solution: Candy
Understand how to apply greedy techniques to solve the candy distribution problem using a two-pass algorithm. This lesson teaches you to allocate candies to children with varying ratings, ensuring minimum candies while meeting constraints. You'll learn to logically adjust candy counts from left to right and right to left to satisfy rating rules efficiently.
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...