Solution: Candy
Explore how to apply greedy techniques to solve the candy distribution problem efficiently. Understand how the two-pass approach ensures each child receives candies according to rating rules while minimizing total candies distributed. This lesson helps you implement a linear time and space complexity solution for optimization problems related to ratings and allocations.
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...