DSA Level 1 Dynamic Programming Dynamic Programming and Greedy Buy And Sell Stocks - K Transactions Allowed

Buy And Sell Stocks - K Transactions Allowed

easy

1. You are given a number n, representing the number of days.
2. You are given n numbers, where ith number represents price of stock on ith day.
3. You are given a number k, representing the number of transactions allowed.
3. You are required to print the maximum profit you can make if you are allowed k transactions at-most.
Note - There can be no overlapping transaction. One transaction needs to be closed (a buy followed by a sell) before opening another transaction (another buy).

Input Format

A number n .. n more elements A number k

Output Format

A number representing the maximum profit you can make if you are allowed a single transaction.

Constraints

0 &lt;= n &lt;= 20
0 &lt;= n1, n2, .. &lt;= 10
0 &lt;= k &lt;= n / 2

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

Buy And Sell Stocks - Two Transactions Allowed