Maximize profit with transaction fee
Company: Coinbase
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: Medium
Interview Round: Onsite
Given an array of daily stock prices and a fixed transaction fee charged on each sell, compute the maximum profit achievable with any number of buy–sell transactions. Provide an O(n) time, O(
1) or O(n) space algorithm, prove correctness, and describe how you would handle edge cases such as empty input or strictly decreasing prices.
Quick Answer: This question evaluates algorithm design and optimization skills, focusing on reasoning about stateful dynamic programming or greedy strategies to maximize stock-trading profit when each sell incurs a transaction fee.