In this project I apply some dynamic programming techniques in order to solve the problem Best Time to Buy and Sell Stock IV from LeetCode.com
In order to view the project simply open the jupyter notebook max-profit-with-k-transactions.ipynb, everything else is explained within it.
However if GitHub refuses to render the notebook, you may view it at this NBVIEWER LINK
This project represents the capstone project for the online course on Data Structures and Algorithms in Python provided by Jovian.ml.
Special thanks to Aakash N S and the rest of the Jovian.ml crew that made the course possible.