#Dynamic Programming

Determine the minimum cost path in a given grid where each cell has a cost. Provide the algorithm to find the path with the least cost from the top left to the bottom right of the grid.

Solve the Coin Change 2 problem. Your solution should involve returning the number of combinations of coins that can make up a given amount. For example, an input of amount 5 with coins [1, 2, 5] would yield a certain number of combinations.

Solve optimization problems that focus on dynamic programming and mathematical techniques.

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.