ORIGINAL CODING QUESTION
Island cluster count
One cells are land. Count connected land components using four-side adjacency.
Original exercise · medium. Editorial role relevance does not imply a company has asked this question.
Input and output
rows cols, then rows×cols cell values in row-major order. Print one integer.
Constraints
1 ≤ rows,cols ≤ 12; each cell is 0 or 1; adjacency uses four sides, not diagonals.
Example 1
Input
2 3 1 0 1 1 0 1
Output
2
Two land columns form two islands.
Example 2
Input
2 2 1 0 0 1
Output
2
Diagonal cells form separate islands.
Explain your approach
Explain your time and auxiliary space complexity. Which input makes your algorithm work hardest?
Private grading inputs, expected outputs and canonical reference implementations are withheld. Authored expected outputs were cross-checked with independent reference oracles; compiler/runtime behavior still needs a verified execution provider.
Hint 1
A new unvisited land cell starts one island.
Hint 2
Visit its whole connected component.
Hint 3
Mark cells when adding them to a queue or stack.
Practice this question
Save your work privately, explain decisions and return to your revision queue.
Open practice workspaceBrowse the question library →