Search
⌘K

Leetcode 1254. Number of Closed Islands

Count the number of 4-directionally connected components of 0s in a binary grid that are completely surrounded by 1s (i.e., the component does not touch the grid boundary). This is a flood-fill/DFS-BFS style problem on an up to 100x100 grid.

Asked at:

Google

Google


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Late January, 2026

Google

Google

Senior

Early January, 2026

Google

Google

Manager

Mid November, 2025

Google

Google

Staff

Comments

Your account is free and you can post anonymously if you choose.