Given an integer array, find the contiguous subarray that has the largest product.
Input: nums = [2,3,-2,4] Output: 6 ([2,3]) Input: nums = [-2,0,-1] Output: 0
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features