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