Darbar 372 — Shortest Subarray With Sum At Least K
Hard
Darbar · Queue
Catalog slot 372 of 548 (source id 74). Topic queue / sliding window.
Solve on LeetCode: Shortest Subarray With Sum At Least K. Do not treat this page as a statement dump.
Aligned T2T band: weeks 1–6. Start at Week 1. Full map: Darbar hub.
Pattern block: Advanced and interview fusion (weeks 61-90, slots 361-470). Warmup: Classic DP and greedy patterns. Exam: Mixed 4-problem block mirroring a real interview.
Also filed under: heap / prefix sum, heap / queue based.
Evidence (cookiecutter problem_372.md)
- Attempt log (approaches that failed)
- Final complexity (time and space)
- One mistake corrected
- Production concept this slot reinforces
Personal dates and the CSV tracker stay in the learner journal.
Same subtopic
- Jump Game Vi · medium
- Max Value Of Equation · hard
- Longest Continuous Subarray With Absolute Diff Less Than Or Equal To Limit · medium
Darbar slot 372 of Tensor-to-Tenant · Previous · Next.