Max Profit From Stock Prices | Dataford Interview Questions

You were asked to reason about stock prices throughout the day and compute the maximum possible profit from a single buy and sell without trivial brute force. How would you solve it?

Implement max_profit(prices). Given a list of daily prices, return the greatest profit from buying on one day and selling on a later day. Return 0 when no profitable transaction exists.

Input: prices, a list of integers. Output: an integer profit.

Constraints

0 <= prices.length <= 10^5
0 <= prices[i] <= 10^9
At most one buy and one later sell are allowed
Return 0 when no profitable transaction exists

Function Signature

def max_profit(prices):

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