Single-Transaction Ticket Profit | Dataford Interview Questions

Given an array of event ticket prices, write a function to find the maximum profit you can make by buying and selling a ticket, assuming you can only transact once.

Implement max_profit(prices), where prices[i] is the ticket price on day i. You must buy before selling and may return 0 if no profitable transaction exists. Return the maximum profit as an integer.

Constraints

1 <= prices.length <= 100000
0 <= prices[i] <= 1000000000
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 Single-Transaction Ticket Profit. 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 event ticket prices, write a function to find the maximum profit you can make by buying and selling a ticket, assuming you can only transact once.

Constraints

1 <= prices.length <= 100000
0 <= prices[i] <= 1000000000
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 Single-Transaction Ticket Profit. 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.