Best Time to Buy and Sell Stock

Problem: Given a list of stock prices find the best possible profit you can make.

Example 1:

Input: prices = [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1] Output: 0 Explanation: In this case, no transactions are done and the max profit = 0.

• C++
• Python

// 7 ms (Beats 90%)
// 11.15 MB (Beats 32%)

# 54 ms (Beats 96%)
# 17.43 MB (Beats 54%)
class Solution:
    def maxProfit(self, prices: List[int]) -> int: