Maximum Product Subarray

1. 1
   Learn the pattern

   Define dp[i] in words first, then the recurrence is usually one line. Start from the base cases.

2. 2
   Trace your version

   Paste your solution into the workspace and watch every step execute.

   Open workspace
3. 3
   Solve it

   Solve it on LeetCode, then mark it solved here to keep your streak alive.

   Solve on LeetCode Mark solved