You are given an $m \times n$ maze, where $0$ represents an empty cell, and $1$ represents a wall.

A ball starts at position start = [start_row, start_col], and you want to determine whether it can stop exactly at position destination = [destination_row, destination_col].

The ball can be rolled in one of the four cardinal directions: up, down, left, or right. Once the ball starts moving, it continues rolling through consecutive empty cells in that direction until it encounters a wall or the boundary of the maze. The ball then stops at the last empty cell before the obstacle.

Because the ball only stops when its movement is blocked, it cannot stop in the middle of an open corridor.

Return TRUE if the ball can eventually stop at destination. Otherwise, return FALSE.

Important: The ball may pass through the destination while rolling, but this does not count as reaching it. The destination is considered reached only if the ball can stop exactly on that cell.

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_row, destination_row $< m$

• $0 \leq$ start_col, destination_col $< n$

• Both the ball and destination are located on empty cells, and they are not initially in the same position.

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

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.