kill space

vbrazo · web-flow · commit f6382bfb15b9 · 2021-09-03T12:37:45.000-07:00
diff --git 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.

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,3 @@`
`1`		`-`
`2`	`1`	`# Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.`
`3`	`2`	`# It is guaranteed that the answer will fit in a 32-bit integer.`
`4`	`3`	`# A subarray is a contiguous subsequence of the array.`