Dynamic Programming

Determine whether an integer array can be partitioned into two subsets whose sums are equal.

Given a grid of non-negative weights, find the minimum sum of a path from the top-left corner to the bottom-right corner, moving only down or right.

You are given n balloons indexed from 0 to n - 1, each painted with a number in nums. You burst all the balloons. When you burst balloon i, you gain nums[i - 1] * nums[i] * nums[i + 1] coins; if i - 1 or i + 1 is out of bounds, treat that neighbor as a balloon with value 1. Return the maximum coins you can collect by bursting the balloons in an optimal order.