Number of Islands Problem Statement

You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in this matrix. An island is comprised of connected groups of 1s. A connection between cells exists in all eight possible directions: two vertically, two horizontally, and four diagonally.

Input:

The first line contains two integers N and M, representing the number of rows and columns, respectively, in the matrix. Each of the next N lines contains M integers separated by spaces, depicting matrix values.

Output:

The output consists of a single integer which is the number of islands found in the matrix.

Example:

Input:

4 5 1 0 0 1 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 1

Output:

5

Constraints:

1

Question

Number of Islands Problem Statement

You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in this matrix. An island is comprised of connected groups of 1s. A connection between cells exists in all eight possible directions: two vertically, two horizontally, and four diagonally.

Input:

The first line contains two integers N and M, representing the number of rows and columns, respectively, in the matrix.
Each of the next N lines contains M integers separated by spaces, depicting matrix values.

Output:

The output consists of a single integer which is the number of islands found in the matrix.

Example:

Input:

Output:

Constraints:

1 <= N <= 10^3
1 <= M <= 10^3
0 <= ARR[i][j] <= 1
Time limit: 1 second.

Note:

No need for explicit printing; just implement the function and provide the correct output.

Accepted Answer

Count the number of islands in a 2D matrix of 1s and 0s.

Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid redundant traversal.
Increment the island count whenever a new island is encountered.
Consider all eight possible directions for connectivity between cells.
Handle edge cases like out of bounds indices and already visited cells.