Question
A warehouse plans tomorrow's opening stock for a product. You're given the day's projected net changes in order (receipts positive, dispatches negative). The stock level after each change must never go below zero. Return the smallest non-negative opening stock that makes this true. Example: changes [-3, 2, -5] need an opening stock of 6, since running levels would otherwise reach -3, -1, -6.
min_opening_stock(changes: list[int]) → int[[-3,2,-5]]out6State 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.
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.