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

Solution: Candy

Explore how to apply a greedy algorithm to distribute candies fairly among children based on their ratings. This lesson guides you through a two-pass approach that ensures each child receives at least one candy and those with higher ratings than their neighbors get more. Understand how to implement and analyze time and space complexity for an efficient solution.

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