Given an array, prices, where prices[i] represent the price of a stock on the i-th day, maximize profit by selecting a single day to buy the stock and a different day in the future to sell it.

Return the maximum profit that can be achieved from this transaction. If no profit can be made, return 0.

Constraints:

• We can’t sell before buying a stock, that is, the array index at which stock is bought will always be less than the index at which the stock is sold.

• $1$ $\leq$ prices.length $\leq$ $10 ^ 3$

• $0$ $\leq$ prices[i] $\leq$ $10^5$

Let's take a moment to make sure that you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Implement your solution in the following coding playground.