We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Number Line Jumps
  5. Discussions

Number Line Jumps

  • alysonleonard19
     + 1 comment

    Javascript O(1)

        if (v2 >= v1) {
    return "NO";
}

//initial distance
let d1 = x2 - x1;

//distance after 1 jump
let d2 = (x2 + v2) - (x1 + v1);

//diff gives how much closer x1 gets after each jump
let x = d1 - d2;

//if initial distance can be evenly divided by how
//close x1 gets each jump, they will eventually meet.

if (d1 % x === 0) {
    return "YES";
} else {
    return "NO";
}