Python: I don't know why some of y'all are using loops

def kangaroo(x1, v1, x2, v2):
    # Write your code here
    
    if v1 <= v2:
        return "NO"
        
    if v1 % v2 == 0 and (x2 % x1 == 0):
        return "YES"
        
    n_steps = (x2 - x1) / (v1 - v2)
    
    if n_steps % 1 == 0:
        return "YES"
    
    return "NO"

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;
}

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

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");

}****