Simulate Stock Trading for Maximum Profit | Dataford Interview Questions

You are given an array prices where prices[i] is the price of a given stock on the i-th day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve. If you cannot achieve any profit, return 0.

Constraints

1 <= prices.length <= 10^5
0 <= prices[i] <= 10^4

Function Signature

def max_profit(prices: list[int]) -> int:

Your question is Simulate Stock Trading for Maximum Profit. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= prices.length <= 10^5
0 <= prices[i] <= 10^4

Function Signature

def max_profit(prices: list[int]) -> int:

Your question is Simulate Stock Trading for Maximum Profit. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.