mediumBlind 75
Maximum Subarray
Given an integer array nums Find the contiguous subarray with the largest sum Return the maximum sum Example: [-2,1,-3,4,-1,2,1,-5,4] => 6 (subarray [4,-1,2,1])
Maximum Subarray is about turning repeated work into a reusable state instead of re-solving subproblems. Interviewers love it because it reveals your state-and-transition thinking and your edge-case discipline. Once you define the right state, the transitions usually write themselves.
Arrays & HashingDynamic Programming
Meet Coco
Coco is an AI study partner, not a person. She listens while you explain your code, asks what a line does and never hands you the fix. Typing with Coco is free when you sign in, up to a daily limit. Talking with her out loud comes with the $79 pack. Anyone can open the editor and run their code.
1Maximum Subarray Summedium
Based onLeetCode