Coding Quiz - Maximize Stock Trading Profit

In this coding quiz, you are tasked with writing a function to determine the most profitable buy and sell days from a given list of stock prices.

You will receive a list of stock prices as input from the user, and your function should calculate and return the maximum profit obtainable from a single transaction.

The stock must be bought before it is sold, and buying and selling cannot take place on the same day.

For example, given the stock prices [7, 1, 5, 3, 6, 4],

buying at the lowest price of 1 and selling at 6 results in a profit of 5. Therefore, the maximum profit is 5.

Copy
def solution(prices):
    # Write your code here
    return

---

• The length of the input list will be at least 2.

• All stock prices are positive integers.

---

• Input: [7, 1, 5, 3, 6, 4]

• Output: 5

• Input: [7, 6, 4, 3, 1]

• Output: 0