diff --git a/SamsonOkeji/Arrays/day-14/MaxProdSubArray b/SamsonOkeji/Arrays/day-14/MaxProdSubArray
index e69de29..05e25ea 100644
--- a/SamsonOkeji/Arrays/day-14/MaxProdSubArray
+++ b/SamsonOkeji/Arrays/day-14/MaxProdSubArray
@@ -0,0 +1,20 @@
+var maxProduct = function(nums) {
+    // Max product in the current contiguous array
+    let currentMax = nums[0];
+    // Min product in the current contiguous array. We need this value in case we encounter 2 negative numbers whose product could potentially give us the max product of the entire array
+    let currentMin = nums[0];
+    // Max product of a contiguous array
+    let finalMax = nums[0];
+
+  for(let i = 1; i < nums.length; i++){
+    let temp = currentMax
+    // Because we are looking for a contiguous subarray product, the current max must contain the current number in the array. 
+    currentMax = Math.max(Math.max(currentMax * nums[i], currentMin*nums[i]), nums[i])
+    // Use temp here in case the previous currentMax was negative
+    currentMin = Math.min(Math.min(temp * nums[i], currentMin*nums[i]), nums[i])
+    // Record highest max at the end of every contiguous subarray
+    finalMax = Math.max(currentMax, finalMax);
+  }
+
+  return finalMax;
+};
\ No newline at end of file