Max Profit Stock Trading | Dataford Interview Questions

Given an array of transaction values, write an algorithm to find the maximum profit possible from buying and selling a stock. Implement def max_profit(prices):, where prices[i] is the stock value on day i; return the maximum profit from one buy followed by one later sell, or 0 if no profit is possible. For example, [7, 1, 5, 3, 6, 4] returns 5, while [7, 6, 4, 3, 1] returns 0; use 1 <= len(prices) <= 10^5.

Constraints

1 <= prices.length <= 10^5
0 <= prices[i] <= 10^9
At most one buy and one sell are allowed
The sell day must occur after the buy day

Function Signature

def max_profit(prices):

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

Constraints

1 <= prices.length <= 10^5
0 <= prices[i] <= 10^9
At most one buy and one sell are allowed
The sell day must occur after the buy day

Function Signature

def max_profit(prices):

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