Stock Profit Optimization | Dataford Interview Questions

Write an efficient function that takes yesterday's stock prices as a list and returns the best profit I could have made from 1 purchase and 1 sale of the stock yesterday.

Implement def max_profit(prices):. Return the maximum profit as an integer, or 0 if no profitable transaction is possible. The sale must occur after the purchase, and the input contains at least two prices.

Constraints

2 <= len(prices) <= 100000
0 <= prices[i] <= 100000
Only one purchase and one sale may be made
The sale must occur after the purchase

Function Signature

def max_profit(prices):

Your question is Stock Profit 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

Write an efficient function that takes yesterday's stock prices as a list and returns the best profit I could have made from 1 purchase and 1 sale of the stock yesterday.

Constraints

2 <= len(prices) <= 100000
0 <= prices[i] <= 100000
Only one purchase and one sale may be made
The sale must occur after the purchase

Function Signature

def max_profit(prices):

Your question is Stock Profit 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.