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. (Problem)

				
    import math
    class Solution:
        def maxProfit(self, prices: List[int]) -> int:
            max_profit=0
            mi=math.inf
            for i in range(len(prices)):
                if(prices[i]<mi):mi=prices[i]
                max_profit=max(abs(prices[i]-mi),max_profit)
            return max_profit
							
			

Time Complexity => o(n)

Space Complexity => o(1)