Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Solution: Candy

Explore how to apply greedy algorithms to distribute candies based on children's ratings efficiently. This lesson helps you understand and implement a two-pass strategy to ensure minimum candies are used while satisfying problem constraints and improving your coding interview skills.

We'll cover the following...

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:

  • 1≤1 \leq ratings.length ...