Solution: Candy
Explore the greedy technique to distribute candies optimally according to children's ratings. Understand a two-pass algorithm that ensures every child receives at least one candy and higher-rated children get more than their neighbors. This lesson teaches you to implement and analyze the solution for efficient time and space complexity.
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 ...