Question

Given a starting position'k' and two jump sizes 'd1' and 'd2',our task is to find the minimum number of jumps to reach x if it is possible.else print -1​

Answer 1

Answer:

roskkg zl all gl dp dp zl zl

Explanation:

risk gf it FL h sb CV NB