R
|
🔥Problem of the Day+50 XPDev Score: 780/1000
All Problems (8)
EasyArrays & Hashing•Acceptance: 54.6%

Best Time to Buy & Sell Stock: Volatility Profit Tracker

Real-World Engineering Context
Algorithmic trading engines at Jane Street and Citadel analyze historical asset windows to execute high-frequency arbitrage trades.
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`.

Sample Test Cases

Input: [[7,1,5,3,6,4]]
Expected: 5
Input: [[7,6,4,3,1]]
Expected: 0
Input: [[2,4]]
Expected: 2

Constraints

  • 1 <= prices.length <= 10^5
  • 0 <= prices[i] <= 10^4