Title: #676 - Implement Magic Dictionary - LeetCode JavaScript Solutions
Open Graph Title: #676 - Implement Magic Dictionary - LeetCode JavaScript Solutions
X Title: #676 - Implement Magic Dictionary - LeetCode JavaScript Solutions
Description: Design a data structure that is initialized with a list of different words. Provided a string, you should determine if you can change exactl...
Open Graph Description: Design a data structure that is initialized with a list of different words. Provided a string, you should determine if you can change exactl...
X Description: Design a data structure that is initialized with a list of different words. Provided a string, you should determine if you can change exactl...
Keywords:
Opengraph URL: https://leetcodejavascript.com/solutions/implement-magic-dictionary
Domain: leetcodejavascript.com
{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/implement-magic-dictionary","name":"#676 - Implement Magic Dictionary - LeetCode JavaScript Solutions","description":"Design a data structure that is initialized with a list of different words. Provided a string, you should determine if you can change exactl...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"var MagicDictionary = function() {\n this.words = new Set();\n};\n\n/**\n * @param {string[]} dictionary\n * @return {void}\n */\nMagicDictionary.prototype.buildDict = function(dictionary) {\n this.words = new Set(dictionary);\n};\n\n/**\n * @param {string} searchWord\n * @return {boolean}\n */\nMagicDictionary.prototype.search = function(searchWord) {\n const words = searchWord.split('');\n return Array.from(this.words).some(word => {\n if (word.length !== searchWord.length) return false;\n let diff = 0;\n for (let i = 0; i < word.length; i++) {\n if (word[i] !== words[i]) diff++;\n if (diff > 1) return false;\n }\n return diff === 1;\n });\n};","keywords":"LeetCode 676, #676 - Implement Magic Dictionary, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}
| author | LeetCodeJavascript.com |
| og:type | article |
| og:image | https://leetcodejavascript.com/og-image.jpg |
| og:site_name | LeetCode JavaScript Solutions |
| twitter:card | summary_large_image |
| twitter:url | https://leetcodejavascript.com/solutions/implement-magic-dictionary |
| twitter:image | https://leetcodejavascript.com/og-image.jpg |
| twitter:creator | @joshcrozier |
| theme-color | #1f2937 |
Links:
| LeetCodeJavascript.com | https://leetcodejavascript.com/ |
| Star on GitHub | https://github.com/JoshCrozier/leetcode-javascript |
| Back to all solutions | https://leetcodejavascript.com |
| View on LeetCode | https://leetcode.com/problems/implement-magic-dictionary/ |
| View on GitHub | https://github.com/JoshCrozier/leetcode-javascript/blob/master/solutions/0676-implement-magic-dictionary.js |
| String | https://leetcodejavascript.com/tags/string |
| Hash Table | https://leetcodejavascript.com/tags/hash-table |
| Depth-First Search | https://leetcodejavascript.com/tags/depth-first-search |
| Design | https://leetcodejavascript.com/tags/design |
| Trie | https://leetcodejavascript.com/tags/trie |
| Josh Crozier | https://joshcrozier.com |
Viewport: width=device-width, initial-scale=1.0
Robots: index, follow