Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

Given an array **Arr** that contains **N** integers (may be **positive**, **negative **or **zero**). Find the product of the maximum product subarray.

**Example 1:**

**Input:
**N = 5
Arr[] = {6, -3, -10, 0, 2}
**Output:** 180
**Explanation:** Subarray with maximum product
is 6, -3, -10 which gives product as 180.

**Example 2:**

**Input:
**N = 6
Arr[] = {2, 3, 4, 5, -1, 0}
**Output:** 120
**Explanation:** Subarray with maximum product
is 2, 3, 4, 5 which gives product as 120.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **maxProduct()** which takes the array of integers **arr** and **n **as parameters and returns an integer denoting the answer.

**Note:** Use 64-bit integer data type to avoid overflow.

**Expected Time Complexity:** O(N)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= N <= 500

-10^{2} <= Arr_{i} <= 10^{2}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Maximum Product Subarray

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.