Rajesh-1234567
commented
6 days ago Hey @indrakishore ! I have created this issue. This ia a most common and best dynamic programming problem asked by many tech giants every year. I request to assign me this issue.
Nanzz94
Problem Statement: 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.
Write a function maxProfit that returns the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Example 1: Input: prices = [7, 1, 5, 3, 6, 4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6 - 1 = 5.
Example 2: Input: prices = [7, 6, 4, 3, 1] Output: 0 Explanation: In this case, no transactions are done and the max profit = 0.
Example 3: Input: prices = [1, 2, 3, 4, 5] Output: 4 Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5 - 1 = 4.
Constraints:
1 <= prices.length <= 10^5 0 <= prices[i] <= 10^4