René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/count-binary-substrings","name":"#696 - Count Binary Substrings - LeetCode JavaScript Solutions","description":"Given a binary string s, return the number of non-empty substrings that have the same number of 0's and 1's, and all the 0's ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s\n * @return {number}\n */\nvar countBinarySubstrings = function(s) {\n  let result = 0;\n\n  for (let i = 0, group = [], count = 1, prevCount = 0; i < s.length; i++) {\n    if (s[i] === s[i + 1]) {\n      count++;\n    } else {\n      if (prevCount) {\n        result += prevCount <= count ? prevCount : count;\n      }\n      prevCount = count;\n      count = 1;\n    }\n  }\n\n  return result;\n};","keywords":"LeetCode 696, #696 - Count Binary Substrings, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}