**Problem Description**

Given a binary matrix **A** of size `N x M`

.

Cells which contain **1** are called **filled cell** and cell that contain **0** are called **empty 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 also connected, they form a **region**. Find the **length of the largest region**.

.

1 <= N, M <= 10^{2}

A[i][j]=0 or A[i][j]=1

First argument is a 2D binary matrix **A**of size ` N x M`

.

Return a single interger denoting the length of largest region.

Input 1:

A = [ [0, 0, 1, 1, 0] [1, 0, 1, 1, 0] [0, 1, 0, 0, 0] [0, 0, 0, 0, 1] ]

Input 2:

A = [ [1, 1, 1] [0, 0, 1] ]

Output 1:

6

Output 2:

4

Explanation 1:

The largest region is denoted by red color in the matrix: 00110 10110 01000 00001

Explanation 2:

The largest region is: 111 001

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

- Hint 1
- Solution Approach
- Complete Solution

Loading...