Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
Three states: hold, sold today, resting; each day transitions from the previous day's states.
def max_profit(prices):
hold,sold,rest=float('-inf'),0,0
for p in prices:
hold,sold,rest=max(hold,rest-p),hold+p,max(rest,sold)
return max(sold,rest)
Linear in the dominant input size for the scan; heap/tree variants add a log factor.
State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.
Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see AI coding interview assistant.