LeetCode 803: Bricks Falling When Hit
A reverse simulation and union-find solution for counting how many bricks fall after each hit.
5 notes
A reverse simulation and union-find solution for counting how many bricks fall after each hit.
A clear explanation of finding the largest plus sign in a mined grid using four directional dynamic programming scans.
A clear explanation of counting distinct island shapes under rotation and reflection using normalization and geometric transformations.
A clear dynamic programming solution for counting paths that move a ball out of a grid boundary.
A clear explanation of finding the best bomb placement in a grid using cached row and column segment counts.