Connected Cells in a Grid

Problem Statement :

Consider a matrix where each cell contains either a 0 or a 1. Any cell containing a 1 is called a filled cell. Two cells are said to be connected if they are adjacent to each other horizontally, vertically, or diagonally. In the following grid, all cells marked X are connected to the cell marked Y.

If one or more filled cells are also connected, they form a region. Note that each cell in a region is connected to zero or more cells in the region but is not necessarily directly connected to all the other cells in the region.

Given an  matrix, find and print the number of cells in the largest region in the matrix. Note that there may be more than one region in the matrix.

Function Description

Complete the connectedCell function in the editor below.

connectedCell has the following parameter(s):
- int matrix[n][m]:  represents the  row of the matrix

- int: the area of the largest region

Input Format

The first line contains an integer , the number of rows in the matrix.
The second line contains an integer , the number of columns in the matrix.
Each of the next  lines contains  space-separated integers .

Solution :


                            Solution in C :

In   C++  :

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100;
int n, m, x[MAXN][MAXN];

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            scanf("%d", &x[i][j]);
    int maxi = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (x[i][j] == 0) continue;
            int cnt = 1;
            queue<vector<int> > q;
            q.push({i, j});
            x[i][j] = 0;
            while (!q.empty()) {
                vector<int> front = q.front();
                for (int dx = -1; dx <= 1; dx++) {
                    for (int dy = -1; dy <= 1; dy++) {
                        int nx = dx + front[0];
                        int ny = dy + front[1];
                        if (nx >= 0 && ny >= 0 && nx < n && ny < m && x[nx][ny] == 1) {
                            x[nx][ny] = 0;
                            q.push({nx, ny});
            maxi = max(maxi, cnt);
    printf("%d\n", maxi);
    return 0;

In   Java :

import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
		Scanner in = new Scanner(;
		int m = in.nextInt();
		int n = in.nextInt();
		int[][] matrix = new int[m][n];
		for(int i=0; i<m; i++){
			for(int j=0; j<n; j++){
				matrix[i][j] = in.nextInt();
		int maxRegion = 0;
		for(int i=0; i<m; i++){
			for(int j=0; j<n; j++){
				if(matrix[i][j] == 1){
					int count = countRegion(matrix, m, n, i, j);
					if(count > maxRegion)
						maxRegion = count;
	static int countRegion(int[][] matrix, int m, int n, int x, int y) {
        if ((x < 0) || (x >= m) || (y < 0) || (y >= n) || (matrix[x][y] == 0))
                return 0;
        matrix[x][y] = 0;
        return 1 + countRegion(matrix,m,n, x - 1, y) 
        		+ countRegion(matrix,m,n,x + 1, y) 
        		+ countRegion(matrix,m,n,x, y - 1) 
        		+ countRegion(matrix,m,n,x, y + 1)
        		+ countRegion(matrix, m, n, x+1, y+1)
        		+ countRegion(matrix, m, n, x-1, y+1)
        		+ countRegion(matrix, m, n, x+1, y-1)
        		+ countRegion(matrix, m, n, x-1, y-1);

In    C  :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
void countone(int i, int j);

int mat[100][100];
int bat[100][100];
int m,n;
int main()

int i,j,k,p,q,sum=0,maxsum=0;

//int mat[100][100];


bat[i][j] = mat[i][j];

maxsum = 0;



sum = 0;
sum = sum + 1;

maxsum = sum;





void countone(int i, int j)
if(i>=0 && j>=0 && i<m && j<n && bat[i][j] == 1)

In   Python3 :

rows = int(input())
cols = int(input())

mat = []
for _ in range(rows):
    mat.append([int(x=='1') for x in input().strip().split(' ')])

ones = set()

for row in range(rows):
    for col in range(cols):
        if mat[row][col]:
            ones.add((row, col))
regions = []
while ones:
    n = ones.pop()
    region = [n]
    unchecked = [n]
    while unchecked:
        xr, xc = unchecked.pop()
        for r in [-1,0,1]:
            for c in [-1,0,1]:
                if p in ones:
print(max((len(region) for region in regions), default=0))

View More Similar Problems

Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →