Quarantine Hopper Route

A courier robot starts at checkpoint 0 on a one-dimensional quarantine road. It wants to reach checkpoint home. In one move, the robot may jump forward by exactly forward units or jump backward by exactly backward units. However, because backward movement destabilizes the robot, it is not allowed to make two backward jumps in a row. Some checkpoints are sealed and cannot be landed on. Input Format: You are given an array blocked and three integers forward, backward, and home. Output Format: Return the minimum number of jumps needed to reach home, or -1 if no valid route exists.