Return the maximum profit from one buy and one sell. Variant **#31**.
Example 1
Input: prices = [11,14,10,13,9,12,8]
Output: 3
Constraints
Acceptance: 76% · Topics: array, dynamic-programming
← All practice problems