📘

Best Time to Buy and Sell Stock

Given an array prices where prices[i] is the price of a given stock on the i-th day, find the maximum profit you can achieve by buying on one day and selling on a later day.

If no profit is possible, return 0.

Example:

Input:

7,1,5,3,6,4

Output:

Reasoning:

We start by initializing the minimum price and maximum profit: $min\_price = 7$ , $max\_profit = 0$ .
We then iterate through the array, updating $min\_price$ $min_p r i ce$ and $max\_profit$ $ma x_p ro f i t$ as we find lower prices and higher profits:
- On the second day, $min\_price = 1$ .
- On the third day, $max\_profit = 5 - 1 = 4$ .
- On the fifth day, $max\_profit = 6 - 1 = 5$ .
The final output is $max\_profit = 5$ .

Constraints:

1 <= len(prices) <= 10^5
0 <= prices[i] <= 10^4

Editor

Python 3.13.1

Test Results

0/0

Run code to see test results.