You are given four integers rows, cols, rCenter, and cCenter, representing a matrix with dimensions rows $\times$ cols and a specified center cell at coordinate (rCenter, cCenter).

Return a list of the coordinates of all cells in the matrix, ordered by their Manhattan distance from (rCenter, cCenter) in nondecreasing order.

The Manhattan distance between two cells $(r_1, c_1)$ and $(r_2, c_2)$ is $|r_1 - r_2| + |c_1 - c_2|$.

Note: If multiple cells have the same distance from the center, they may appear in any order relative to each other.

Constraints:

• $1 \leq$ rows, cols $\leq 100$

• $0 \leq$ rCenter $<$ rows

• $0 \leq$ cCenter $<$ cols

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.