Search⌘ K
AI Features

Best Time to Buy and Sell Stock

Explore how to apply greedy algorithms to find the maximum profit from buying and selling stock within a given price array. Understand the problem constraints, logic, and implement an optimal solution that runs efficiently in linear time and constant space.

Statement

Given an array, prices, where prices[i] represent the price of a stock on the i-th day, maximize profit by selecting a single day to buy the stock and a different day in the future to sell it. ...