You don't have access to this post on Coding Today at the moment, but if you upgrade your account you'll be able to see the whole thing, as well as all the other posts in the archive! Subscribing only takes a few seconds and will give you immediate access.
Minimum steps to reach the target by a Knight
The idea is to use the BFS based on the limited set of possible moves the Knight can go across each direction. We traverse like a spider and return the number of moves as soon as we reach the target.