diff --git a/data_structures/arrays/maximum_product_subarray.rb b/data_structures/arrays/maximum_product_subarray.rb
index 37d97d2..2c5be6f 100644
--- a/data_structures/arrays/maximum_product_subarray.rb
+++ b/data_structures/arrays/maximum_product_subarray.rb
@@ -1,4 +1,3 @@
-
 # Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.
 # It is guaranteed that the answer will fit in a 32-bit integer.
 # A subarray is a contiguous subsequence of the array.