diff --git a/src/main/java/leetcode/medium/MaximumProductSubarray.java b/src/main/java/leetcode/medium/MaximumProductSubarray.java
index ac89e2b..869b009 100644
--- a/src/main/java/leetcode/medium/MaximumProductSubarray.java
+++ b/src/main/java/leetcode/medium/MaximumProductSubarray.java
@@ -12,6 +12,7 @@ int maxProduct(int[] nums) {
     for (int i = 0; i < n; i++) {
 
       //if any of leftProduct or rightProduct become 0 then update it to 1
+
       leftProduct = (leftProduct == 0 || leftProduct < Integer.MIN_VALUE) ? 1 : leftProduct;
       rightProduct = (rightProduct == 0 || rightProduct < Integer.MIN_VALUE) ? 1 : rightProduct;