The Classic 75 Stage 6 of 75
Appearance
Palette
Start each problem at
Write shows nothing of the solution until you ask. Kept on this device, not in your account.
Running best and worstMedium
Find the largest product of any run of one or more neighbouring numbers in nums.
Aim for O(n) time, O(1) spaceInspired by a classic interview problem ↗
The practice panel runs the code in your browser, so it needs JavaScript.