Python O(n) solution for 2/1/22 daily
\nclass Solution:\n    def maxProfit(self, prices: List[int]) -> int:\n        lowest_price, best_profit = float("inf"), 0\n        for price in prices:\n      
```\nclass Solution:\n    def maxProfit(self, prices: List[int]) -> int:\n        lowest_price, best_profit = float("inf"), 0\n        for price in prices:\n            profit = price - lowest_price\n            best_profit = max(profit, best_profit)\n            lowest_price = min(price, lowest_price)\n        return best_profit\n```
[]