Every prpblem was beautifully explained Master, I was able to visualize everything that you said ,and was able to do the code by myself ,keep it up master
because you can skip last step. (2,0) -> (2,0) -> (4,0) -> (4,0) -> (6,0) -> (6,0) -> (8,0) ; you dont need to take step to Y because you reached the point already
He will cover small steps let's say if k is 5 then in X direction he will move 0 distance then in y 5 units then again in x 0 and again in y 5 units making a total of 4 steps. I hope it helps
Every prpblem was beautifully explained Master, I was able to visualize everything that you said ,and was able to do the code by myself ,keep it up master
Help! with problem C. why if x=8, y=0, k=2 there should be 7 steps and not 8 steps it would take to get from 0,0 to 8,0. please explain....
because you can skip last step. (2,0) -> (2,0) -> (4,0) -> (4,0) -> (6,0) -> (6,0) -> (8,0) ; you dont need to take step to Y because you reached the point already
@@neptunns8537 thank you so much 😁
pls show solutions
Problem C has the wrong answer on test 2.
I don't know why😢
Yes bro
you do not know how to solve doesn't mean the test case is wrong
see this test case: 4 3 7
answer is : 2
@@mohamedmahdi6036
Yes
How (0,10) is possible if k
He will cover small steps let's say if k is 5 then in X direction he will move 0 distance then in y 5 units then again in x 0 and again in y 5 units making a total of 4 steps. I hope it helps
he will 0 in x-direction turns 0
Jump 1(x) (0,0) ... Jump 2(y) (0,8) ... Jump 3(x) (0,8) ... Jump 4(y) (0,10)