You are given a $0$ indexed two dimensional integer array grid of size m $\times$ n, where:

• grid[r][c] = $0$ represents a land cell.

• grid[r][c] > $0$ represents a water cell containing grid[r][c] fish.

A fisher can start at any water cell (r, c) and perform the following operations:

• Catch all the fish at the current cell (r, c).

• Move to any adjacent water cell in the four cardinal directions (up, down, left, or right).

The fisher can continue moving to adjacent water cells that have not yet been visited.

Return the maximum number of fish the fisher can collect. If there are no water cells in grid, return $0$.

Constraints:

• m == grid.length

• n == grid[i].length

• $1 \leq$ m, n $\leq 10$

• $0 \leq$ grid[i][j] $\leq 10$

Now, 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.