Wu Shixiong's Large Model Academy
Aug 17, 2023 · Interview Experience
How to Minimize Clicks in the “Happy Elimination” Grid Puzzle Using BFS/DFS
This article explains the 2023Q1A "Happy Elimination" problem, where a binary matrix must be turned all zeros by clicking cells that toggle themselves and their eight neighbors, and shows how to compute the minimum number of clicks with BFS or DFS counting connected components.
BFSDFSPython
0 likes · 9 min read