Let’s consider a scenario with an $(m \times n)$ 2D grid containing binary numbers, where '0' represents water and '1' represents land. If any '1' cells are connected to each other horizontally or vertically (not diagonally), they form an island. Your task is to return the total number of islands in the grid.

Constraints:

• $1 \leq$ grid.length $\leq 50$

• $1 \leq$ grid[i].length $\leq 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 main.py in the following coding playground. You will need the provided supporting code to implement your solution.