even-number-of-knight-moves

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two integer arrays <code>start</code> and <code>target</code>, where each array is of the form <code>[x, y]</code> representing a cell on a standard 8 x 8 chessboard.

Return <code>true</code> if a knight can move from <code>start</code> to <code>target</code> in an even number of moves. Otherwise, return <code>false</code>.

Note: A valid knight move consists of moving two squares in one direction and one square perpendicular to it. The figure below illustrates all eight possible moves from a cell.

<img src="https://assets.leetcode.com/uploads/2018/10/12/knight.png" style="height: 200px; width: 200px;" />

&nbsp;
Example 1:

<div class="example-block">
Input: start = [1,1], target = [2,2]

Output: true

Explanation:

One possible sequence of moves is <code>(1, 1) -&gt; (3, 2) -&gt; (2, 4) -&gt; (4, 3) -&gt; (2, 2)</code>.

The knight reaches the target in 4 moves, which is even. Thus, the answer is <code>true</code>.
</div>

Example 2:

<div class="example-block">
Input: start = [4,5], target = [6,6]

Output: false

Explanation:​​​​​​​

It is impossible to reach <code>target = [6, 6]</code> from <code>start = [4, 5]</code> in an even number of moves. Thus, the answer is <code>false</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>start.length == target.length == 2</code></li>
	<li><code>0 &lt;= start[i], target[i] &lt;= 7</code></li>
</ul>