Best Time to Buy and Sell Stock Problem Statement

Given an array prices representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can achieve by buying and selling the stock once.

Example:

Input:

prices = [2, 100, 150, 120]

Output:

148

Explanation:

The maximum profit can be achieved by buying at minute 0 for Rs. 2 and selling at minute 2 for Rs. 150, resulting in a profit of 150 - 2 = 148.

Constraints:

• 1 <= T <= 10
• 2 <= N <= 10^4
• 1 <= prices[i] <= 10^9

Note: You cannot sell before buying.

If the maximum profit is negative, consider it as 0.