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