Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
Try with Dynamic programming, dp(pos,steps): number of ways to back pos = 0 using exactly "steps" moves.
Notice that the computational complexity does not depend of "arrlen".