Given an array of stock prices for consecutive days and a range [buy, sell] where 0 <= buy < sell < length of array, find the maximum possible profit from a single buy and sell within the given range. The buy and sell days should be fully contained within the given range.
Explanation: Step-by-step: with input [1, 2, 3, 4, 5], we find the maximum possible profit by considering all possible buy and sell days within the given range. We can buy on the first day and sell on the fourth day, giving a profit of 4 - 1 = 3. However, we can also buy on the first day and sell on the fifth day, giving a profit of 5 - 1 = 4. Therefore, the maximum possible profit is 4.
Explanation: Step-by-step: with input [5, 4, 3, 2, 1], we find the maximum possible profit by considering all possible buy and sell days within the given range. However, since the prices are decreasing, there is no possible profit, so the output is 0.
Master coding challenges related to Arrays and solve the [Backup] Maximum Profit from Stock Prices problem optimally.
No dry run loaded.
🚀 Practice this problem
Run code, get AI hints & track streak