Everybody loves a kangaroo right? Except maybe if you are Australian! Anyway in this post we shall talk both about snakes and mammals, or more specific Python and Kangaroos. I have started on learning a bit of Python and using HackerRank to learn my ways around. I have been solving a few puzzles by now. The ones I have solved so far, are no where near the complexity of Project Euler. Apart from the fact that quite a few of the project euler problems are actually represented at HackerRank, but with more test cases, so you have to write the code a little more generically. But more about that later, because I will likely solve a few of the Project Euler problems in Python while learning it.

Anyway, the first problem I solved, which might be worth spending a minute or two about, is the problem called Kangaroo.

The short description of the problem is as follows

There are two kangaroos on a number line ready to jump in the positive direction (i.e, toward positive infinity). The first kangaroo starts at location x_{1} and moves at a rate of v_{1} meters per jump. The second kangaroo starts at location x_{2} and moves at a rate of v_{2} meters per jump. Given the starting locations and movement rates for each kangaroo, can you determine if they’ll ever land *at the same location at the same time*?

**Input Format**

A single line of four space-separated integers denoting the respective values of x_{1}, v_{1}, x_{2} and v_{2}

**Note:** The two kangaroos must land at the same location *after making the same number of jumps*.

Continue reading →