Stock Buy-Sell Coding Problem | Dataford Interview Questions

Given a list of historic stock prices, what is the best time to buy and sell to maximize profit?

Implement max_profit(prices). Return [buy_index, sell_index, profit] for one profitable transaction, or [-1, -1, 0] when no profit is possible. Buy and sell must occur on different days.

Constraints

2 <= prices.length <= 10^4
0 <= prices[i] <= 10^9
At most one transaction may be made
The buy day must precede the sell day

Function Signature

def max_profit(prices):

Your question is Stock Buy-Sell Coding Problem. 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

Given a list of historic stock prices, what is the best time to buy and sell to maximize profit?

Implement max_profit(prices). Return [buy_index, sell_index, profit] for one profitable transaction, or [-1, -1, 0] when no profit is possible. Buy and sell must occur on different days.

Constraints

2 <= prices.length <= 10^4
0 <= prices[i] <= 10^9
At most one transaction may be made
The buy day must precede the sell day

Function Signature

def max_profit(prices):

Your question is Stock Buy-Sell Coding Problem. 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.