yes

103. Market Interception

Time Limit: 1 seconds

Memory Limit: 256 MB

Rating: 800

The criminal syndicate is profiting from a volatile artifact trading market. Your mission is to determine the perfect time to buy low and sell high to intercept the syndicate's profits. Input is denoted by a list of $N$ integers $prices$. - Each integer represents the price of the artifact on a given day. - Your task is to maximize profit by choosing one day to buy and one day to sell, ensuring the buying day comes before the selling day. If no profit can be made, return $0$. For example, given $prices = [7, 1, 5, 3, 6, 4]$, buy on day 2 (price = 1) and sell on day 5 (price = 6), yielding a profit of $6 - 1 = 5$.

You are given an integer $N$ on the first line, followed by $N$ space-separated integers that form the array $prices$.

Output one non-negative integer: the maximum profit that can be made. If it is impossible to make a profit with the given input, output $0$.

Sample Input 1:
6
7 1 5 3 6 4

Sample Output 1:
5

An explanation is already given in the problem statement.

KL Coding Cup March 2025 > Speed Round > Problem 8