Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- 1. Count number of islands in matrix (Leetcode challenge)
Coding
- Find Number of Islands with One Edit Allowed
Coding
- Number of Distinct Islands
Coding · Array · Breadth-First Search · Depth-First Search
- Number of Distinct Islands II
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Amazon
Leetcode 1254. Number of Closed Islands
Reported Apr 17, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceGoogle
Leetcode 1254. Number of Closed Islands
Reported Sep 1, 2026 · 7 source reports
MANAGER, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source