You are given a 2D grid of size $m \times n$, where each cell contains either a $0$ or a $1$.

A $1$ represents the home of a friend, and a $0$ represents an empty space.

Your task is to return the minimum total travel distance to a meeting point. The total travel distance is the sum of the Manhattan distances between each friend’s home and the meeting point.

The Manhattan Distance between two points (x1, y1) and (x2, y2) is calculated as:
|x2 - x1| + |y2 - y1|.

Constraints:

• $m ==$ grid.length

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

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

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

• There will be at least two friends in the grid.

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.