Max Stock Price Difference Coding | Dataford Interview Questions

Solve a problem to calculate the maximum stock price difference.

Given an array of daily stock prices, return the largest difference prices[j] - prices[i] where i < j. You may buy once and sell once. Return 0 if no positive difference is possible.

Function: def max_stock_price_difference(prices): Input is a non-empty list of integers, and output is an integer.

Constraints

1 <= len(prices) <= 10^4
0 <= prices[i] <= 10^9
The buy day must occur before the sell day
Return 0 when no positive difference exists

Function Signature

def max_stock_price_difference(prices):

Your question is Max Stock Price Difference Coding. 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