Solution: Candy

Let’s solve the Candy problem using the Greedy Techniques pattern.

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:

  1. Every child must receive at least one candy.

  2. Children with a higher rating get more candies than their neighbors.

Determine the minimum total number of candies you must distribute to satisfy the above conditions.

Constraints:

  • 11 \leq ratings.length ...