Solution: Candy
Understand how to implement a two-pass greedy algorithm that distributes candies to children based on their ratings while meeting strict rules. Learn to manage increasing and decreasing sequences effectively to minimize total candies. This lesson teaches you to solve optimization problems with greedy techniques, analyze time and space complexities, and refine solutions through multiple passes.
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...