Maximum Product Subarray | Array | GFG POTD | C++ | Java | Code Kar Lo

Given an array arr[] that contains positive and negative integers (may contain 0 as well). Find the maximum product that we can get in a subarray of arr.

Note: It is guaranteed that the output fits in a 32-bit integer.

0:00 Introduction
0:11 Problem Statement
0:41 Explanation
9:03 C++ Code
12:46 Java Code

gfg potd
gfg potd today
gfg problem of the day
potd gfg
potd
potd today
gfg

#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming

[EmaJohnson-gu]

bhai ye code -2, 0, -1 k liye 1 return krega jbki -1 aana chahiye max wali condition if se pahle honi chahiye

[Raushankumar-tsny]

Isko pick or not pick Bala process bata skte hai kese kre code