CodingMediumcod-g292

Subject Grid traversalLevel Mid–Senior~20 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given an R x C binary grid, a 'blob' is a maximal group of 1-cells connected 8-directionally (including diagonals). Return the size (number of 1-cells) of the largest blob. If there are no 1-cells, return 0.

Implement

largest_blob(grid: list[list[int]]) → int

Examples

in[[[1,1,0,0],[1,0,0,1],[0,0,1,1]]]out3

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.