Problem: Maximum Product Subarray
Given an integer array nums, find a
subarray
the product
The test cases are generated so that the answer will fit in a 32-bit integer.
Example 1:
Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
Example 2:
Input: nums...
mackph.hashnode.dev1 min read