mediumBlind 75
Maximum Product Subarray
Find the contiguous subarray with largest product Example: [2,3,-2,4] => 6
Maximum Product Subarray is a dynamic programming question: define the state cleanly and the transitions usually follow. Interviewers love it because it reveals your state-and-transition thinking and your edge-case discipline. Don't rush the code—spend your time nailing the state definition first.
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 Product Subarraymedium
Based onLeetCode