Can you solve this real interview question? Minimum Jumps to Reach Home - A certain bug's home is on the x-axis at position x. Help them get there from position 0. The bug jumps according to the following rules: * It can jump exactly a positions forwa
* Given an array of integers forbidden, where forbidden[i] means that the bug cannot jump to the position forbidden[i], and integers a, b, and x, return the minimum number of jumps needed for the bug to reach its home. If there is no possible sequence of jumps that lands the bug ...