Given two integer arrays source $= [$ sr, sc $]$ and target $= [$ tr, tc $]$, representing the coordinates of a queen and a destination square on an $8 imes 8$ chessboard.

In one move, a queen can travel any number of squares in a straight line horizontally, vertically, or diagonally.

Return the minimum number of moves required to move the queen from source to target.

Constraints:

• source $= [$ sr, sc $]$

• target $= [$ tr, tc $]$

• $1 \leq$ sr, sc, tr, tc $\leq 8$

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.