CodingMediumcod-g518

Subject Dynamic programming 1dLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given daily prices of a stock, you may complete as many buy/sell transactions as you like, but you can hold at most one share at a time and after you sell you must wait one full day (cooldown) before buying again. Return the maximum profit. The price list may be empty.

Implement

stock_with_cooldown(prices: list[int]) → int

Examples

in[[1,2,3,0,2]]out3

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.