Knight Walk
Medium Accuracy: 72.34% Submissions: 3582 Points: 4

Given a square chessboard, the initial position of Knight and position of a target. Find out the minimum steps a Knight will take to reach the target position.

The initial and the target position co-ordinates of Knight have been given accoring to 1-base indexing.


Example 1:

knightPos[ ] = {4, 5}
targetPos[ ] = {1, 1}

Knight takes 3 step to reach from 
(4, 5) to (1, 1):
(4, 5) -> (5, 3) -> (3, 2) -> (1, 1).



Your Task:
You don't need to read input or print anything. Your task is to complete the function minStepToReachTarget() which takes the inital position of Knight (KnightPos), the target position of Knight (TargetPos) and the size of the chess board (N) as an input parameters and returns the minimum number of steps required by the knight to reach from its current position to the given target position.


Expected Time Complexity: O(N2).
Expected Auxiliary Space: O(N2).


1 <= N <= 1000
1 <= Knight_pos(X, Y), Targer_pos(X, Y) <= N

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Knight Walk

Output Window