Incredible hulk doubt

#1

hi pls check
test cases are not passing

#2

hello @vatsal50
please expalin ur logic.

#3

let suppose input n is 25. If we take log(25) in base 2 , it is 4.So, 2^4 i.e 16 steps he will take in one go. Next 9 steps he will take one by one.So total 1 +9=10 steps he must take. Thats how I thought.

#4

16 is largest power of two which is less than 25

#5

no that will not give u minimum path,
16 + 8 + 1-> in 3 steps u can reach