There is a $10^6 \times 10^6$ grid where coordinates $(x, y)$ satisfy $0 \leq x, y < 10^6$. You are given an array of blocked cells blocked, where each blocked[i] $= [x_i, y_i]$ represents a cell that cannot be visited.

You are also given a starting cell source $= [s_x, s_y]$ and a destination cell target $= [t_x, t_y]$.

From any cell, you can move to an adjacent cell in any of the $4$ cardinal directions (up, down, left, or right), provided that the next cell is within the grid boundaries and is not contained in blocked.

Return true if it is possible to reach target from source, or false otherwise.

Constraints:

• $0 \leq$ blocked.length $\leq 200$

• blocked[i].length $= 2$

• $0 \leq x_i, y_i < 10^6$

• source.length $=$ target.length $= 2$

• $0 \leq s_x, s_y, t_x, t_y < 10^6$

• source $\neq$ target

• It is guaranteed that source and target are not blocked.

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.