#Dynamic Programming

You are given an array where each element represents your maximum jump length at that position. Write a function to find the minimum number of jumps needed to reach the last index of the array.

Given two strings, find the length of their longest common subsequence. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous. For example, given strings 'abcde' and 'ace', the longest common subsequence is 'ace' with length 3.

Given an array of integers, find the contiguous subarray (containing at least one number) which has the largest product and return the product. Implement your solution using dynamic programming.