René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-product-subarray","name":"#152 - Maximum Product Subarray - LeetCode JavaScript Solutions","description":"Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maxProduct = function(nums) {\n let result = nums[0];\n let min = 1;\n let max = 1;\n for (let n of nums) {\n [min, max] = [Math.min(n, min * n, max * n), Math.max(n, min * n, max * n)];\n result = Math.max(result, max);\n }\n return result;\n};","keywords":"LeetCode 152, #152 - Maximum Product Subarray, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}