CodingHardcod-g520

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

Question

Given an integer k and daily prices, find the maximum profit with at most k completed transactions, holding at most one share at a time. k can be 0 and can exceed the number of days. The price list may be empty.

Implement

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

Examples

in[2,[2,4,1]]out2

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.