<ul><li>You are given an array ratings, where each element represents a child’s rating. You need to distribute candies to these children while meeting certain rules.</li><li>Each child must get at least 1 candy. Children with higher ratings must receive more candies than their neighbors.</li><li>The problem can be efficiently solved using a two-pass greedy approach.</li><li>The time complexity of the solution is O(n), where n is the number of children.</li></ul>

LeetCode Challenge: 135. Candy - JavaScript Solution 🍬

Discover more