Best Time to Buy and Sell Stock
Easy
Arrays
Given an array where prices[i] is the price of a stock on day i, choose one day to buy and a later day to sell to maximise profit. Print the maximum profit, or 0 if no profit is possible.
Constraints
1 <= n <= 10^5 0 <= prices[i] <= 10^4
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.