Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 37

Lesson walkthrough

Best Time to Buy and Sell Stock

EasySliding WindowIntervals + Greedy

prices[i] is the price of a stock on day i. You may buy once and sell once later. Return the maximum profit, or 0 if no profit is possible.

Examples

Example 1

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

Output: 5

Explanation: Buy on day 1 (price = 1) and sell on day 4 (price = 6), profit = 6 - 1 = 5.

Example 2

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

Output: 0

Explanation: Prices never rise after a cheaper earlier day, so no profitable transaction exists. Return 0.

Constraints

1 ≤ prices.length ≤ 10⁵0 ≤ prices[i] ≤ 10⁴

Target ComplexityNot required

O(n) Time · O(1) Space

Companies (7)

AmazonGoogleMetaMicrosoftAppleBloombergAdobe

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputprices = [7,1,5,3,6,4]

Expected5

Output—

Buy on day 1 (price = 1) and sell on day 4 (price = 6), profit = 6 - 1 = 5.