Darbar 280 — Shortest Subarray With Sum At Least K

Hard

Darbar · Heap

Catalog slot 280 of 548 (source id 801). Topic heap / prefix sum.

Solve on LeetCode: Shortest Subarray With Sum At Least K. Do not treat this page as a statement dump.

Aligned T2T band: weeks 31–45. Start at Week 31. Full map: Darbar hub.

Pattern block: Tree and graph fluency (weeks 31-45, slots 201-280). Warmup: Tree traversals and adjacency-list graph walks. Exam: Tree+graph block with one design flavored problem.

Also filed under: heap / queue based, queue / sliding window.

Triangulation — Heap: Darbar speed is Top-K and scheduler problems; Forge depth is Heap invariants and adversarial streams; production artifact is Streaming Top-K / inference batching.

Evidence (cookiecutter problem_280.md)

1. Attempt log (approaches that failed)
2. Final complexity (time and space)
3. One mistake corrected
4. Production concept this slot reinforces

Personal dates and the CSV tracker stay in the learner journal.

Same subtopic

• Find Kth Largest Xor Coordinate Value · medium
• Car Pooling · medium
• Get Biggest Three Rhombus Sums In A Grid · medium
• Car Pooling · medium

Heap index · Darbar hub

Darbar slot 280 of Tensor-to-Tenant · Previous · Next.