Stock Trading With Constraints | Dataford Interview Questions

Solve the classic Best Time to Buy and Sell Stock problem with various constraints, such as allowing multiple transactions or incorporating transaction fees.

Implement max_profit(prices, max_transactions=None, fee=0). Return the maximum profit, where each transaction consists of one buy followed by one sell, transactions cannot overlap, and the fee is charged on each sale. If max_transactions is None, any number of transactions is allowed.

Input: a list of integer prices, an optional nonnegative transaction limit, and a nonnegative fee. Output: one integer maximum profit.

Constraints

0 <= prices.length <= 100000
0 <= prices[i] <= 100000
max_transactions is None or 0 <= max_transactions <= 50000
0 <= fee <= 100000
A transaction must sell before another transaction can begin

Function Signature

def max_profit(prices, max_transactions=None, fee=0):

Your question is Stock Trading With Constraints. 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

Solve the classic Best Time to Buy and Sell Stock problem with various constraints, such as allowing multiple transactions or incorporating transaction fees.

Input: a list of integer prices, an optional nonnegative transaction limit, and a nonnegative fee. Output: one integer maximum profit.

Constraints

0 <= prices.length <= 100000
0 <= prices[i] <= 100000
max_transactions is None or 0 <= max_transactions <= 50000
0 <= fee <= 100000
A transaction must sell before another transaction can begin

Function Signature

def max_profit(prices, max_transactions=None, fee=0):

Your question is Stock Trading With Constraints. 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.