Darbar 013 — Maximum Subarray
Easy
Darbar · Array
Catalog slot 13 of 548 (source id 237). Topic array / dp based.
Solve on LeetCode: Maximum Subarray. 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: Timed routing (weeks 1-15, slots 1-120). Warmup: LeetCode-style easy problems (15 min each). Exam: Weekly timed block, 3-5 problems in 60 minutes.
Also filed under: divide and conquer / divide and conquer.
Evidence (cookiecutter problem_013.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
- Best Time To Buy And Sell Stock · easy
- Get Maximum In Generated Array · easy
- Stone Game Ii · medium
- Beautiful Arrangement · medium
Darbar slot 13 of Tensor-to-Tenant · Previous · Next.