Profit Maximization Stock Problem | Dataford Interview Questions

Get the highest profit by buying and selling stock once.

Asked in the tech screen stage. 2019 EM tech screen.

Given prices, where prices[i] is a stock price on day i, return the maximum profit achievable by buying on one day and selling on a later day. Return 0 if no profitable transaction exists.

Input and Output

prices is a list of integers. Return an integer representing the maximum profit.

Constraints

1 <= len(prices) <= 1000
0 <= prices[i] <= 10^5
At most one buy and one sell are allowed
The sell day must be later than the buy day

Function Signature

def max_profit(prices):

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