Added Code for Best Time To Buy and Sell Stocks and Added Different Error Page Templates

DSA/Cpp/Dynamic_Programming/Best Time to Buy and Sell Stock atmost B times.cpp

@@ -0,0 +1,30 @@
+#include "bits/stdc++.h"
+using namespace std;
+
+int solve(vector<int> &prices, int k)
+{
+   int n = prices.size();
+   if (k >= n / 2)
+   {
+      int profit = 0;
+      for (int i = 1; i < n; i++)
+         if (prices[i] > prices[i - 1])
+            profit += prices[i] - prices[i - 1];
+      return profit;
+   }
+
+   vector<int> buy(k + 1, INT_MIN);
+   vector<int> sell(k + 1, 0);
+
+   int ans = 0;
+   for (int i = 0; i < n; i++)
+   {
+      for (int j = 1; j <= k; j++)
+      {
+         buy[j] = max(buy[j], sell[j - 1] - prices[i]);
+         sell[j] = max(sell[j], buy[j] + prices[i]);
+      }
+   }
+
+   return sell[k];
+}

DSA/Cpp/Dynamic_Programming/Best Time to Buy and Sell Stocks I.cpp

@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int maxProfit(const vector<int> &A)
+{
+   int minVal = INT_MAX;
+   int maxProfit = 0;
+
+   for (int i = 0; i < A.size(); i++)
+   {
+      if (A[i] < minVal)
+         minVal = A[i];
+      else
+      {
+         maxProfit = max(maxProfit, A[i] - minVal);
+      }
+   }
+   return maxProfit;
+}

DSA/Cpp/Dynamic_Programming/Best Time to Buy and Sell Stocks II.cpp

@@ -0,0 +1,23 @@
+#include "bits/stdc++.h"
+using namespace std;
+
+int Solution::maxProfit(const vector<int> &A)
+{
+   if (A.size() == 0)
+      return 0;
+   int min = A[0];
+   int sum = 0;
+   for (int i = 1; i < A.size(); i++)
+   {
+      if (A[i] < min)
+      {
+         min = A[i];
+      }
+      if (A[i] > min)
+      {
+         sum = sum + A[i] - min;
+         min = A[i];
+      }
+   }
+   return sum;
+}