Problem Description
If you were only permitted to complete at most one transaction (i.e, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Return the maximum possible profit.
0 <= len(A) <= 7e5
1 <= A[i] <= 1e7
The first and the only argument is an array of integers, A.
Return an integer, representing the maximum possible profit.
Input 1:
A = [1, 2]
Input 2:
A = [1, 4, 5, 2, 4]
1
Output 2:
4
Explanation 1:
Buy the stock on day 0, and sell it on day 1.
Explanation 2:
Buy the stock on day 0, and sell it on day 2.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
1 Million +
Strong Tech Community500 +
Questions to Practice100 +
Expert Interview Guides
