https://github.com/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?
https://github.com/ndsvw/maximum-profit-problem
algorithm complexity-analysis dynamic-programming maximum-profit price
Last synced: 8 months ago
JSON representation
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?
- Host: GitHub
- URL: https://github.com/ndsvw/maximum-profit-problem
- Owner: ndsvw
- License: mit
- Created: 2019-12-02T17:46:05.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2019-12-28T21:26:36.000Z (almost 6 years ago)
- Last Synced: 2025-01-14T02:25:55.181Z (9 months ago)
- Topics: algorithm, complexity-analysis, dynamic-programming, maximum-profit, price
- Language: Python
- Size: 148 KB
- Stars: 1
- Watchers: 3
- Forks: 0
- Open Issues: 0