ByteDance Research Scientist interview questions

The first question is to find the shortest path for a knight from start location to the destination location in a square map. The knight has two types of movement, which are specified in the problem statement. The second problem is to implement a binary search to find the target number in an array without redundant elements. The next follow up question is to search in an array with redundant elements. The final follow up is about how to optimize the code to reduce the total number of comparison operations.