function avoidObstacles(nums) {
    
  const largestObstacle = nums.reduce((prev, curr) => {
    return curr > prev ? curr : prev;
  });
  
  for (let jump = 2; jump <= largestObstacle; jump++) {
    if (nums.every(obstacle => obstacle % jump !== 0)) {
      return jump;
    }
  }
  return largestObstacle + 1;
}


/**
* Test Suite 
*/
describe('avoidObstacles()', () => {
    it('returns minimal number of jumps in between numbers', () => {
        // arrange
        const nums = [5, 3, 6, 7, 9];
        
        // act
        const result = avoidObstacles(nums);

        // log
        console.log("result: ", result);
        
        // assert
        expect(result).toBe(4);
    });
});