You are given two integer arrays start and target of length $2$, representing the coordinates of a knight on an $8 imes 8$ chessboard.

Return true if the knight can reach target from start in an even number of moves, or false otherwise.

Note: In a single move, a knight can move $2$ squares in one direction horizontally or vertically and $1$ square in the perpendicular direction.

Constraints:

• start.length $==$ target.length $== 2$

• $0 \leq$ start[i], target[i] $\leq 7$

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.