Candy

#135
Hard
Greedy
O(n)
O(n)
Amazon
Microsoft
Google
View on LeetCode

Problem Description

There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.