best-time-to-buy-and-sell-stock

Author: Shikha-code36

Arrays/001-twosum.py

@@ -7,7 +7,7 @@ def twoSum(nums, target):
                   if nums[i] + nums[j] == target:
                         return [i,j]
 #T:O(N^2)
-#S:O(N)
+#S:O(1)
 
 #Solution2 hashmap
 #use hash map to instantly check for difference value, map will add index of last occurrence of a num, don’t use same element twice

Arrays/121-Best-Time-To-Buy-and-Sell-Stock.py

@@ -0,0 +1,29 @@
+'''Leetcode - https://leetcode.com/problems/best-time-to-buy-and-sell-stock/'''
+
+#Solution1
+def maxProfit(prices):
+    maxp= 0
+
+    for i in range(len(prices)-1):
+        for j in range(i+1,len(prices)):
+            profit = prices[j]-prices[i]
+            if profit>maxp:
+                maxp=profit
+    return maxp
+
+#T:O(N^2)
+#S:O(1)
+
+#Solution2
+def maxProfit(prices):
+    maxp= 0
+
+    l = 0
+    for r in range(1, len(prices)):
+        if prices[r] < prices[l]:
+                l = r
+        maxp = max(maxp, prices[r] - prices[l])
+    return maxp
+
+# T: O(N)
+# S: O(1)