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

Sort by

recency

|

3966 Discussions

|

  • olbarbag
     + 0 comments

    In Java 15

    public static String kangaroo(int x1, int v1, int x2, int v2) {

     //x1 + v1*f = x2 + v2*f
 //(x1-x2)+(v1-v2)*f = 0

    String result = "";
    double f = (double) (x2-x1)/(v1-v2);

    if(f < 0 || (f*10)%10 != 0){
       result = "NO"; 
    } else {
        result = "YES";
    }
    return result;
}

  • DhruvSaraswat
     + 0 comments

    The problem statement isn't very clear.

    It doesn't specify whether the kangaroos only have to meet at the end of a jump or does it count if they cross paths mid-jump as well

  • gav_dunnett
     + 0 comments
    def kangaroo(x1, v1, x2, v2):
    denominator = v1 - v2
    if denominator == 0: return 'NO'
    j = (x2 - x1) / denominator
    if j.is_integer() and j > 0: return 'YES'
    else: return 'NO'

  • cloud_sagarb
     + 0 comments
    public static String kangaroo(int x1, int v1, int x2, int v2) {
// Write your code here
int kangaroo1=x1, kangaroo2=x2;
if (kangaroo1>kangaroo2) {
   while(kangaroo1>=kangaroo2){
    kangaroo1=kangaroo1+v1;
    kangaroo2=kangaroo2+v2;
    if(kangaroo1==kangaroo2){
        return("YES");
    }
   }

} else if(kangaroo1<kangaroo2) {
     while(kangaroo1<=kangaroo2){
    kangaroo1=kangaroo1+v1;
    kangaroo2=kangaroo2+v2;
    if(kangaroo1==kangaroo2){
        return("YES");
    }  
}

} else{
    do {
    kangaroo1=kangaroo1+v1;
    kangaroo2=kangaroo2+v2;
    if(kangaroo1==kangaroo2){
        return("YES");
    } 
    } while (kangaroo1 != kangaroo2);

}
return("NO");

    }****

  • u24ch022
     + 0 comments

    def kangaroo(x1, v1, x2, v2): # Write your code here if(v1>v2 and ((x2-x1)%(v1-v2)==0)): return("YES") else: return('NO')