Please explain incredible hulk problem

#1

Please explain the incredible hulk problem as the explanation wasn’t enough for me.

#2

see
the question asks u
how many minimum steps are required to reach from 0 to reach nth level
u can take jumps in power of 2.

eg
N = 2
answer = 1 ( directly take jump of power 2 )

N = 3
in this u need to move to nearest power of 2 which lies before 3
ie 2
then take another jump of power of 2^0 ie 1
to reach 3
ie. take jump 2^1 + 2^0 == 3

-> 2 jumps

#3

think of using bit operations

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.