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

Solution: Candy

Explore a greedy algorithm that solves the candy distribution problem by ensuring each child gets at least one candy and children with higher ratings get more than neighbors. Learn how to implement a two-pass solution that balances complexity and correctness, preparing you to handle similar optimization problems in 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 ...