Maximize stock profit with constraints

Q: Maximize stock profit with constraints

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.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

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(

additional space. Return 0 if no profitable trades exist.

Maximize stock profit with constraints

Overview

Comments (0)