You are given an array with some values..traverse the array according to the rule that if a[i]=x then you can jump max up to x steps.. (if a[i]=0 then you can't move any forward) find the least number of steps required to traverse the array ...
EG:a[]=1 3 5 8 9 7 8 0 2 this requires 3 steps to traverse the array .. I think its DP .. but its just my intuition ..!! -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
