Robbo the Robot is lost and needs find a way home. Given his start location, [x, y], and end location, [x, y], write a method that will tell Robbo the shortest path to take to get home.
Robbo can move in any direction, including diagonally. The path should go through integer coordinates only, and each number should increase by only 1 (or 0) each time. It should also account for negative coordinates.
Please refer to the test cases for examples