Number Line Jumps | Kangaroo Problem | HackerRank | Algorithms | Interview

thank you so much

Bro I am sure that people chosing short videos for code and losing this much of explanation from you !!!
But people who watched your videos gets good knowledge and others get only code !
Thanks for explaining ☺️

My Explaination : ) Instead of iterating every time
at particular n jumps it will meet then both positions at same point
1st = a+n(b)
2nd = x+n(y)
both points are eq right ?
let us eq 1st=2nd
i.e., a+n(b)=x+n(y)
after solving this we get n=(a-x)/(y-b)
and if its reminder is 0 its perfectly divisible and meets at particular point : )

really a good explaination !!!!!!!!

explained well..please continue series on hackerRank problem solving questions.....most have not explained why they are doing(x2-x1)%(v1-v2)..but u explained well

I was looking for the animal but hey something new !:)

Hello can I hire you for a python script

Another nice session