Buy and Sell Stock | Dataford Interview Questions

Given an array of prices, find the maximum profit possible.

Assume you may buy once and sell once, and the sale must occur after the purchase. Implement max_profit(prices), which accepts a list of nonnegative integers and returns the maximum profit as an integer, or 0 when no profitable transaction exists.

Constraints

1 <= prices.length <= 1000
0 <= prices[i] <= 10^9
At most one purchase and one sale are allowed
The sale must occur after the purchase

Function Signature

def max_profit(prices):

Your question is Buy and Sell Stock. 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

Given an array of prices, find the maximum profit possible.

Constraints

1 <= prices.length <= 1000
0 <= prices[i] <= 10^9
At most one purchase and one sale are allowed
The sale must occur after the purchase

Function Signature

def max_profit(prices):

Your question is Buy and Sell Stock. 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.