René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/valid-parentheses","name":"#20 - Valid Parentheses - LeetCode JavaScript Solutions","description":"Given a string s containing just the characters '(', ')', '{', '}', '[' and ']',...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} s\n * @return {boolean}\n */\nvar isValid = function(s) {\n  const map = {\n    '(': ')',\n    '[': ']',\n    '{': '}',\n  };\n  const stack = [];\n\n  for (let i = 0; i < s.length; i++) {\n    if (map[s[i]]) {\n      stack.push(map[s[i]]);\n    } else {\n      if (stack.pop() !== s[i]) {\n        return false;\n      }\n    }\n  }\n\n  return stack.length === 0;\n};","keywords":"LeetCode 20, #20 - Valid Parentheses, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}