dsa · easy

Best Time to Buy and Sell Stock

GreyOrangeArrayTwo PointersFoundation

You are given an array prices where prices[i] is the price of a given stock on the i-th 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.

Arguments

• prices — daily prices; prices[i] is the price on day i

**Example 1:** `` Input: prices = [7,1,5,3,6,4] Output: 5 ` **Example 2:** ` Input: prices = [7,6,4,3,1] Output: 0 ``

Constraints

1 <= prices.length <= 10^5 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.

Examples

Example 1

Input:
[7,1,5,3,6,4]

Expected:
5

Example 2

Input:
[7,6,4,3,1]

Expected:
0

Open in the Dojo editor