Search
⌘K

Leetcode 723. Candy Crush

Given an m×n board of integer "candies," repeatedly find and remove any horizontal or vertical runs of ≥3 identical candies, let the remaining candies fall down to fill gaps (gravity), and repeat until no more removals are possible — return the stabilized board. This tests grid scanning and iterative simulation to detect runs and collapse columns to a fixed point.

Asked at:

Microsoft

Microsoft

Meta


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Late February, 2026

Microsoft

Microsoft

Senior

Early May, 2025

Meta

Senior

Mid March, 2025

Meta

Mid-level

Your account is free and you can post anonymously if you choose.