Stock Buy/Sell Optimization | Dataford Interview Questions

Best time to buy and sell a stock given a list of historic prices.

Given a list of daily prices, return the maximum profit achievable with exactly one buy followed by one sell. If no profitable transaction is possible, return 0. Implement max_profit(prices), where prices is a list of integers and the output is an integer.

Constraints

1 <= prices.length <= 100000
0 <= prices[i] <= 10^9
Buy before selling
At most one transaction is allowed

Function Signature

def max_profit(prices):

Your question is Stock Buy/Sell Optimization. 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

Best time to buy and sell a stock given a list of historic prices.

Constraints

1 <= prices.length <= 100000
0 <= prices[i] <= 10^9
Buy before selling
At most one transaction is allowed

Function Signature

def max_profit(prices):

Your question is Stock Buy/Sell Optimization. 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.