152 with Dynamic Programming

Author: nirmalnishant645

0152-Maximum-Product-Subarray.py

@@ -13,6 +13,11 @@
 Output: 0
 Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
 '''
+
+# Dynamic Programming
+
+# Simlar approach, different steps
+
 class Solution:
  def maxProduct(self, nums: List[int]) -> int:
  min_prod = max_prod = res = nums[0]