ndsvw/Maximum-Profit-Problem

Dynamic-Programming solution of the Maximum Profit Problem: Given an array of n integers representing a price of something over a time period: What is the maximum profit you can make by buying and selling at most k times?

PythonMIT