Maximize stock profit with constraints
Company: Amazon
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: Medium
Interview Round: Technical Screen
Given an array prices of daily stock prices, you may make at most two complete transactions (buy then sell). After each sell, there is a mandatory one-day cooldown during which you cannot buy, and each sell incurs a transaction fee fee. Compute the maximum achievable profit in O(n) time and O(
1) additional space. Return 0 if no profitable trades exist.
Quick Answer: This question evaluates understanding of dynamic programming and state-machine reasoning for constrained optimization, focusing on handling cooldown periods, transaction fees, and in-place O(1) space updates.
