ISTE-VIT / The-CP-Companion

Your ultimate destination for Competitive Coding this Hacktoberfest21
18 stars 74 forks source link

Create Maximum Product Subarray.cpp #156

Closed Begineeryaj closed 2 years ago

Begineeryaj commented 3 years ago

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.