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. If you cannot achieve any profit,
return 0.
prices)Input: [7,1,5,3,6,4] Output: 5
Input: [7,6,4,3,1] Output: 0
Print a single integer representing the maximum profit.
No submissions yet.
Discuss brute-force vs one-pass greedy approach and edge cases.