Array Max Profit for One Buy/Sell | Dataford Interview Questions

Given an array of stock values, find the maximum profit achievable with one buy and one sell.

The buy must occur before the sell, and you may complete at most one transaction. Implement max_profit(prices), which accepts a list of integers and returns the maximum profit as an integer. Return 0 when no profitable transaction is possible.

Constraints

2 <= prices.length <= 100000
0 <= prices[i] <= 1000000
At most one buy and one sell are allowed
The buy must occur before the sell

Function Signature

def max_profit(prices):

Your question is Array Max Profit for One Buy/Sell. 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 an array of stock values, find the maximum profit achievable with one buy and one sell.

Constraints

2 <= prices.length <= 100000
0 <= prices[i] <= 1000000
At most one buy and one sell are allowed
The buy must occur before the sell

Function Signature

def max_profit(prices):

Your question is Array Max Profit for One Buy/Sell. 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.