Problem
Given an array of integers prices where prices[i] is the price of a given stock on the i-th day, return the maximum profit you can achieve from this transaction. You may complete at most one transaction (i.e., buy one and sell one share of the stock). If you cannot achieve any profit, return 0.
Constraints
- 1 <= prices.length <= 10^5
- 0 <= prices[i] <= 10^4
Function Signature
def max_profit(prices: list[int]) -> int:
You are practicing as a guest. Sign up free to run your code against the sample data. Your draft stays right here.
