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

Solution: Candy

Explore the greedy algorithm used to solve the candy distribution problem, where each child in a line receives candies based on ratings. Learn how two passes through the ratings array ensure that children with higher ratings get more candies than neighbors, while minimizing total candies distributed. Understand the approach's time and space complexity to optimize similar 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 ...