💰 Day 18

Author: AkashRajpurohit

README.md

@@ -29,6 +29,8 @@
 1. [Rotate Array](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3496/) ➡️ [CPP Solution](Week3/rotate.cpp)
 2. [Search a 2D Matrix](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3497/) ➡️ [CPP Solution](Week3/searchMatrix.cpp)
 3. [Repeated DNA Sequences](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3498/) ➡️ [CPP Solution](Week3/findRepeatedDnaSequences.cpp)
+4. [Best Time to Buy and Sell Stock IV](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/561/week-3-october-15th-october-21st/3499/) ➡️ [CPP Solution](Week3/maxProfit.cpp)
+
 
 ## Week 4 🚧
 

Week3/maxProfit.cpp

@@ -0,0 +1,31 @@
+class Solution {
+public:
+    int maxProfit(int k, vector<int>& prices) {
+        int n = prices.size();
+        
+        if(n <= 1 || k <= 0) return 0;
+        
+        int profit = 0;
+        if(k >= n / 2) {
+            for(int i = 0; i < n - 1; ++i) {
+                if(prices[i + 1] > prices[i])
+                    profit += prices[i + 1] - prices[i];
+            }
+            
+            return profit;
+        }
+        
+        int buy[k], sell[k];
+        fill(buy, buy + k, INT_MIN);
+        fill(sell, sell + k, 0);
+        
+        for(int i = 0; i < n; ++i) {
+            for(int j = 0; j < k; ++j) {
+                buy[j] = max(buy[j], j == 0 ? 0 - prices[i] : sell[j - 1] - prices[i]);
+                sell[j] = max(sell[j], buy[j] + prices[i]);
+            }
+        }
+        
+        return sell[k - 1];
+    }
+};