Maximum Product Subarray
Greedy & Kadane's Algorithm DSA practice problem on Onlearn.
Difficulty: easy.
Topics: Find the Maximum Product Subarray in an Array Containing Both Negative and Positive Integers, Arrays, Subarray, Time Complexity, Space Complexity, Kadane's Algorithm, dynamic programming, brute force, subarray, number properties, prefix/suffix arrays, kadane's algorithm, time complexity analysis, Prefix/Suffix Products, Edge Case Handling in Arrays.
""" Maximum Product Subarray Given an integer array nums that contains both negative and positive integers, find the maximum product of any non empty subarray. A subarray is a contiguous part of an array. Examples: Example 1: Example 2: """