maxProduct = (nums) => {
    const isEmpty = nums.length === 0;
    if (isEmpty) return 0;

    return greedySearch(nums);/* Time O(N) */
}
Greedy - product
Time O(N) | Space O(1)
https://leetcode.com/problems/maximum-product-subarray/
@param {number[]} nums
@return {number}