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

Solution: Candy

Explore how to solve the candy distribution problem using a two-pass greedy technique. This lesson helps you understand the algorithm to assign candies based on ratings efficiently, ensuring minimal total candies while meeting given constraints and preparing you for optimization style questions in coding interviews.

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 ...