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

Solution: Candy

Explore how to solve the candy distribution problem using a two-pass greedy algorithm. Learn to assign candies efficiently by comparing ratings from left to right and right to left, ensuring every child gets at least one candy and higher-rated children receive more than their neighbors. Understand the approach's time and space complexity to prepare for similar coding interview problems.

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