Make locally optimal choices at each step to find the global optimum.
0 / 1 problems solved
Maximum Subarray