Problem 2123 · Hard

Minimum Operations to Remove Adjacent Ones in Matrix

Colour the ones like a chessboard; the fewest removals equal the largest matching between black and white neighbours.

Open the interactive visualisation