Associated Course(s):
Geeks Classes DSA

Consider a matrix with **N** rows and **M** columns, where each cell contains either a **‘0’** or a **‘1’** and 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. If one or more filled cells are connected, they form a region. The task is to find the unit area of the largest region.

**Input:**

The first line of input will be the number of testcases **T**, then T testcases follow. The first line of each testcase contains 2 space separated integers n and m. Then in the next line are the nxm inputs of the matrix A separated by space.

**Output:**

The output in the expected output will be the length of the largest region formed.

**Constraints:**

1 <= T <= 100

1 <= N, N <= 50

0 <= A[][] <= 1

**Example:
Input:**

2

3 3

1 1 0 0 0 1 1 0 1

1 3

1 1 1

**Output:**

4

3

Explanation:

Testcase 1: Matrix can be shown as follows:

1 1 0

0 0 1

1 0 1

Largest region of 1s in the above matrix is with total 6 1s (colored in Red).

lakshmi_pandey | 72 |

abbatta7 | 68 |

Ashish Kumar Vaishy | 62 |

aman19 | 58 |

Kumar Gaurav Singh | 58 |

saumitra13325 | 612 |

ashujack | 551 |

lakshmi_pandey | 544 |

aman19 | 538 |

piyushmittal25 | 514 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.