René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/word-pattern","name":"#290 - Word Pattern - LeetCode JavaScript Solutions","description":"Given a pattern and a string s, find if s follows the same pattern. Here follow means a full match, such that there is a bijection between a...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} pattern\n * @param {string} s\n * @return {boolean}\n */\nvar wordPattern = function(pattern, s) {\n const words = s.split(' ');\n if (pattern.length !== words.length) return false;\n const map = new Map();\n return pattern.split('').every((char, i) =>\n map.has(char)\n ? map.get(char) === words[i]\n : !([...map.values()].includes(words[i])) && map.set(char, words[i])\n );\n};","keywords":"LeetCode 290, #290 - Word Pattern, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}