CodingHardcod-g751

Subject Dynamic programming 1dLevel Senior–Staff~35 minCommon in Databases & SQL · Algorithms & data structures interviewsIndustries Software development

Question

Given daily prices and an integer k, find the maximum profit with at most k transactions (a transaction is a buy followed by a later sell). You may not engage in multiple transactions simultaneously. Constraints: 0 <= k <= 100, 0 <= n <= 1000, 0 <= price <= 1000.

Implement

max_profit_k(k: int, prices: list[int]) → int

Examples

in[2,[2,4,1,7]]out8

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.