René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/contiguous-array","name":"#525 - Contiguous Array - LeetCode JavaScript Solutions","description":"Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0 and 1. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar findMaxLength = function(nums) {\n  const map = new Map([[0, -1]]);\n  let result = 0;\n\n  for (let i = 0, count = 0; i < nums.length; i++) {\n    count += nums[i] === 1 ? 1 : -1;\n    if (map.has(count)) {\n      result = Math.max(result, i - map.get(count));\n    } else {\n      map.set(count, i);\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 525, #525 - Contiguous Array, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}