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

|

3986 Discussions

|

  • mreshmika4
     + 0 comments

    Java: (x1+n*v1=x2+n*v2)To solve for n, we rearrange the equation:(n*v1-n*v2=x2-x1)(n*(v1-v2)=x2-x1)(n=(x2-x1)/(v1-v2))

    public static String kangaroo(int x1, int v1, int x2, int v2) { // Write your code here String bool ="NO"; if((v1>v2)&&((x2-x1)%(v1-v2)==0)){ bool = "YES"; } return bool; }

    }

  • aarifboy
     + 0 comments
    string kangaroo(int x1,int v1,int x2,int v2){
   if (v2 >= v1)
      return "NO";
   else if ((x2 - x1)%(v1 - v2) == 0)
      return "YES";
   return'NO";
}

  • kashilink778
     + 0 comments

    If I want to add HTML code to a website, how can I do it? Is there a special method that I should learn?

  • noman11
     + 0 comments

    Here's a solution in Javascript

    function kangaroo(x1, v1, x2, v2) {
  let val = "NO";
    for(let i=1 ; i<10000; i++){
      if((x1 + i*v1) == (x2 + i*v2)){
        val = "YES"
      }
    }
   return val;
}

  • sharshitsingh007
     + 0 comments

    C++: Try to write it in mathematical expression form string kangaroo(int x1, int v1, int x2, int v2) { if(v1==v2){ return (x1==x2)? "YES":"NO"; } if((x2-x1)%(v1-v2)==0 && (x2-x1)/(v1-v2)>=0){ return "YES"; } return "NO";

    }