[devyejin] WEEK 05 solutions

best-time-to-buy-and-sell-stock/devyejin.py

@@ -0,0 +1,16 @@
+# time complexity : O(n)
+# space complexity : O(1)
+from typing import List
+
+
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        n = len(prices)
+        min_price = prices[0]
+        max_profit = 0
+
+        for i in range(1, n):
+            min_price = min(min_price, prices[i])
+            max_profit = max(max_profit, prices[i] - min_price)
+
+        return max_profit