You are given an $m × n$ binary matrix grid, where 1 represents land, and 0 represents water.An island is a maximal group of land cells connected 4-directionally (up, down, left, right); diagonal connections do not count. You may assume the grid’s boundary is surrounded by water. The area of an island is the number of land cells it contains.

Your task is to compute and return the maximum area among all islands in the grid. If no island exists, return 0.

Constraints:

• $m ==$ grid.length

• $n ==$ grid[i].length

• $1 <=m, n <= 50$

• grid[i][j] is either $0$ or $1$.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.