buy sell

Author: sachuverma

.vscode/settings.json

@@ -6,6 +6,9 @@
     "initializer_list": "cpp",
     "regex": "cpp",
     "utility": "cpp",
-    "valarray": "cpp"
+    "valarray": "cpp",
+    "chrono": "cpp",
+    "random": "cpp",
+    "limits": "cpp"
   }
 }

DSA Crack Sheet/README.md

@@ -6,20 +6,21 @@
 
 - [Reverse the array](https://www.geeksforgeeks.org/write-a-program-to-reverse-an-array-or-string/ "view topic")
 - [Maximum and minimum of an array using minimum number of comparisons](https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/ "view topic")
-- [Kth smallest element ](https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1 "view questions") - [Cpp Solution](./solutions/Kth%20smallest%20element.cpp)
-- [Sort an array of 0s, 1s and 2s](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1# "view questions") - [Cpp Solution](./solutions/Sort%20an%20array%20of%200s,%201s%20and%202s.cpp)
+- [Kth smallest element ](https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1 "view question") - [Cpp Solution](./solutions/Kth%20smallest%20element.cpp)
+- [Sort an array of 0s, 1s and 2s](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1# "view question") - [Cpp Solution](./solutions/Sort%20an%20array%20of%200s,%201s%20and%202s.cpp)
 - [Move all negative numbers to beginning and positive to end with constant extra space](https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space/ "view topic")
-- [Union of two arrays](https://practice.geeksforgeeks.org/problems/union-of-two-arrays3538/1# "view questions") - [Cpp Solution](./solutions/Union%20of%20two%20arrays.cpp)
-- [Cyclically rotate an array by one](https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one2614/1# "view questions") - [Cpp Solution](./solutions/Cyclically%20rotate%20an%20array%20by%20one.cpp)
-- [Kadane's Algorithm](https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1# "view questions") - [Cpp Solution](./solutions/Kadane's%20Algorithm.cpp)
-- [Minimum number of jumps](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1# "view questions") - [Cpp Solution](./solutions/Minimum%20number%20of%20jumps.cpp)
-- [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/ "view questions") - [Cpp Solution](./solutions/Find%20the%20Duplicate%20Number.cpp)
-- [Merge Intervals](https://leetcode.com/problems/merge-intervals/ "view questions") - [Cpp Solution](./solutions/Merge%20Intervals.cpp)
-- [Next Permutation](https://leetcode.com/problems/next-permutation/ "view questions") - [Cpp Solution](./solutions/Next%20Permutation.cpp)
-- [Count Inversions](https://practice.geeksforgeeks.org/problems/inversion-of-array-1587115620/1# "view questions") - [Cpp Solution](./solutions/Count%20Inversions.cpp)
-- []( "view questions") - [Cpp Solution](./solutions/.cpp)
-
-<!-- - []( "view questions") - [Cpp Solution](./solutions/) -->
+- [Union of two arrays](https://practice.geeksforgeeks.org/problems/union-of-two-arrays3538/1# "view question") - [Cpp Solution](./solutions/Union%20of%20two%20arrays.cpp)
+- [Cyclically rotate an array by one](https://practice.geeksforgeeks.org/problems/cyclically-rotate-an-array-by-one2614/1# "view question") - [Cpp Solution](./solutions/Cyclically%20rotate%20an%20array%20by%20one.cpp)
+- [Kadane's Algorithm](https://practice.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1# "view question") - [Cpp Solution](./solutions/Kadane's%20Algorithm.cpp)
+- [Minimum number of jumps](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1# "view question") - [Cpp Solution](./solutions/Minimum%20number%20of%20jumps.cpp)
+- [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/ "view question") - [Cpp Solution](./solutions/Find%20the%20Duplicate%20Number.cpp)
+- [Merge Intervals](https://leetcode.com/problems/merge-intervals/ "view question") - [Cpp Solution](./solutions/Merge%20Intervals.cpp)
+- [Next Permutation](https://leetcode.com/problems/next-permutation/ "view question") - [Cpp Solution](./solutions/Next%20Permutation.cpp)
+- [Count Inversions](https://practice.geeksforgeeks.org/problems/inversion-of-array-1587115620/1# "view question") - [Cpp Solution](./solutions/Count%20Inversions.cpp)
+- [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ "view question") - [Cpp Solution](./solutions/Best%20Time%20to%20Buy%20and%20Sell%20Stock.cpp)
+- []( "view question") - [Cpp Solution](./solutions/.cpp)
+
+<!-- - []( "view question") - [Cpp Solution](./solutions/) -->
 
 
 ### Matrix

DSA Crack Sheet/solutions/Best Time to Buy and Sell Stock.cpp

@@ -0,0 +1,47 @@
+/*
+Best Time to Buy and Sell Stock
+=================================
+
+You are given an array prices where prices[i] is the price of a given stock on the ith day.
+
+You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.
+
+Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
+
+Example 1:
+Input: prices = [7,1,5,3,6,4]
+Output: 5
+Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
+Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.
+
+Example 2:
+Input: prices = [7,6,4,3,1]
+Output: 0
+Explanation: In this case, no transactions are done and the max profit = 0.
+
+Constraints:
+1 <= prices.length <= 105
+0 <= prices[i] <= 104
+*/
+
+class Solution
+{
+public:
+  int maxProfit(vector<int> &prices)
+  {
+    int n = prices.size();
+    if (n == 0)
+      return 0;
+    int ans = 0;
+    int curr_min = prices[0];
+
+    for (int i = 1; i < n; ++i)
+    {
+      if (prices[i] - curr_min > 0)
+        ans = max(ans, prices[i] - curr_min);
+      curr_min = min(curr_min, prices[i]);
+    }
+
+    return ans;
+  }
+};