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