There is a ball in an m $\times$ n maze consisting of empty spaces represented by $0$ and walls represented by $1$. The ball can travel through empty spaces by rolling up, down, left, or right. It continues rolling in the chosen direction and does not stop until it hits a wall. Once the ball stops, it can choose a new direction.

Given the m $\times$ n grid maze, the initial position of the ball start $= [$ start$_{\text{row}}$, start$_{\text{col}} ]$, and the target position destination $= [$ destination$_{\text{row}}$, destination$_{\text{col}} ]$, return the shortest distance for the ball to stop at the destination. If it is impossible for the ball to stop at the destination, return $-1$.

The distance is measured by the total number of empty spaces traveled from the start position to the destination.

Constraints:

• m $==$ maze.length

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

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

• maze[i][j] is $0$ or $1$.

• start.length $== 2$

• destination.length $== 2$

• $0 \leq$ start$_{\text{row}}$, destination$_{\text{row}} <$ m

• $0 \leq$ start$_{\text{col}}$, destination$_{\text{col}} <$ n

• Both the ball and the destination exist in an empty space, and they will not be in the same position initially.

• The maze contains at least $2$ empty spaces.

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.