LeetCode 152 on Jeanphilo Bloghttps://jeanphilogong.github.io/jeanblog/tags/leetcode-152/Recent content in LeetCode 152 on Jeanphilo BlogHugo -- 0.168.0en-usThu, 08 Oct 2026 00:00:00 +0000LeetCode 152: Maximum Product Subarray, Deriving Two DP States from a Negative Counterexamplehttps://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/152-maximum-product-subarray/Thu, 08 Oct 2026 00:00:00 +0000https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/152-maximum-product-subarray/Start by enumerating nonempty contiguous ranges, then use a negative counterexample to derive maximum and minimum product states and a constant-space Python solution.