Given an array of integers, each element represents the max number of jumps can make forward. What is the minimum number of element selections to reach the end of the array (starting from the first element). Example: arr = 1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9 Here the min # of selections is : 3 with the sequence : 1-> 3 -> 8 ->9 First element is 1, so can only go to 3. Second element is 3, so can make at most 3 jumps: eg to 5 or 8 or 9. If an element is 0, then cannot make any jumps
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
