Code RoomMaximum product subarray
MediumPrep Room Coding #1629

Maximum product subarray

CodingAlgorithms & data structuresMid–Senior~25 min

Return the largest product of any contiguous subarray (at least one element). Values may be negative.

Implement
max_product(nums: list[int]) → int
Examples
in[[2,3,-2,4]]out6
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 25 min
InputExpectedGot
[[2,3,-2,4]]6not run yetsample