JS | Hash table | With explanation
To solve this problem, we can use a Hash table (in this case, I use Set()). \nThe first thing to do is check for the number of characters in the string, if it i
To solve this problem, we can use a Hash table (in this case, I use Set()). \n**The first** thing to do is check for the number of characters in the string, if it is less than 26, it makes no sense to check it. \nIf the string is still larger, we **create a new Set()**, filling it with characters from the string, and setting its size to 26, since Set() can only store **unique** values, 26 unique letters will fall into it, which will mean the **true** in this task, otherwise, if there are less than 26 unique letters - **false**.\n\n```\nvar checkIfPangram = function (sentence) {\n\n    if (sentence.length < 26) return false;\n    return new Set(sentence.split("")).size === 26;\n\n};\n```\n\nI hope I was able to explain clearly.\n**Happy coding!** \uD83D\uDE43
['Hash Table', 'String', 'Ordered Set', 'JavaScript']