Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 803. Bricks Falling When Hit
Given an m×n grid where a brick is stable if connected to the top (directly or via neighboring bricks), apply a sequence of hits that remove bricks and return how many additional bricks fall after each hit. The algorithmic challenge is to compute these results efficiently for up to 200×200 grids and many hits by reasoning in reverse and tracking connectivity (e.g., with Union-Find) to the top.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.