Buy and Sell Stock Problem Statement

Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell transactions to maximize your profit. Your task is to determine the maximum profit that can be achieved. Remember, you must sell the stock before you can buy again.

You can enlist Mr. Mehta's help if needed.

Input:

T (number of test cases)
For each test case:
N (number of days)
N space-separated integers signifying stock prices for each day

Output:

For each test case, output the maximum profit possible on a new line

Example:

Input:

T = 2
Test case 1: N = 5, Prices = [3, 3, 5, 0, 0]
Test case 2: N = 5, Prices = [7, 6, 4, 3, 1]

Output:

Max profit for test case 1: 6
Max profit for test case 2: 0

Constraints:

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 5 * 104
• 0 ≤ price ≤ 103

Note:

- Buying a stock and then selling it constitutes one transaction.
- You cannot engage in multiple simultaneous transactions, meaning you need to sell a stock before you buy again.
- Ensure the function is implemented as specified, there is no need for additional print operations.