Perform matrix Candy Crush elimination

Q: Perform matrix Candy Crush elimination

This question evaluates a candidate's competency in matrix and grid manipulation, neighborhood/adjacency checks, and simulation of state transitions in an array-based board.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Question

Implement a function that, given an m × n integer matrix representing colored blocks (same integers = same color), performs one round of "Candy-Crush" elimination:

A cell is removed (set to 0) if at least two of its four neighbors (up, down, left, right) share the same color as the cell.

After removals, all remaining non-zero cells in each column fall down to fill empty spaces; zeros rise to the top.

Return the resulting matrix after this single round.

Perform matrix Candy Crush elimination

Overview

Question

Comments (0)