Candy

Given a line of children with integer ratings, assign each at least one candy so any child with a higher rating than a neighbor gets more candies, and compute the minimum total required; the core challenge is balancing local increases/decreases across the array (typically handled by scanning increasing/decreasing runs or a two-pass greedy) in linear time.