Channel: Tushar Roy - Coding Made Simple
Category: Education
Tags: stock buy sellstock buy maximum profitdynamic programming
Description: facebook.com/tusharroy25 github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/StockBuySellKTransactions.java github.com/mission-peace/interview/blob/master/python/dynamic/stockbuysellktransactions.py github.com/mission-peace/interview/wiki Given an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most k transactions. Transactions cannot occur in parallel. One transaction should complete before starting another transaction.