Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Candy

Hard Greedy

Children stand in a line with ratings. Every child gets at least one candy and a child with a higher rating than a neighbour gets more candy than that neighbour. Print the minimum total number of candies.

Constraints

1 <= n <= 2 * 10^4 0 <= rating <= 2 * 10^4

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.