Maximum Product Subarray: coding question

Problem

You get an integer array nums. Find the non-empty subarray that has the largest product, and return that product.

A subarray is a part of the array with consecutive items. The product of a subarray is the result when you multiply all its items.

The answer fits in a 32-bit integer.

Input:: nums = [-2,5,-3]
Output:: 30
Explanation:: The product of two negative numbers is positive. So the full array gives the largest product, -2 * 5 * -3 = 30.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

Maximum Subarray
Coding · Array · Divide and Conquer · Dynamic Programming
Maximum Profit in Job Scheduling
Coding · Array · Binary Search · Dynamic Programming
Maximum Sum of Two Non-Overlapping Subarrays
Coding · Array · Dynamic Programming · Sliding Window
Partition Array for Maximum Sum
Coding · Array · Dynamic Programming

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 2 records

LeetCode company tags · 2 records

Problem

You get an integer array nums. Find the non-empty subarray that has the largest product, and return that product.

A subarray is a part of the array with consecutive items. The product of a subarray is the result when you multiply all its items.

The answer fits in a 32-bit integer.

Input:: nums = [-2,5,-3]
Output:: 30
Explanation:: The product of two negative numbers is positive. So the full array gives the largest product, -2 * 5 * -3 = 30.

SysRound wrote this statement. A reference solution checks every example.