Add solution #1832

Author: JoshCrozier

README.md

@@ -239,6 +239,7 @@
 1672|[Richest Customer Wealth](./1672-richest-customer-wealth.js)|Easy|
 1748|[Sum of Unique Elements](./1748-sum-of-unique-elements.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
+1832|[Check if the Sentence Is Pangram](./1832-check-if-the-sentence-is-pangram.js)|Easy|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
 1886|[Determine Whether Matrix Can Be Obtained By Rotation](./1886-determine-whether-matrix-can-be-obtained-by-rotation.js)|Easy|
 1920|[Build Array from Permutation](./1920-build-array-from-permutation.js)|Easy|

solutions/1832-check-if-the-sentence-is-pangram.js

@@ -0,0 +1,19 @@
+/**
+ * 1832. Check if the Sentence Is Pangram
+ * https://leetcode.com/problems/check-if-the-sentence-is-pangram/
+ * Difficulty: Easy
+ *
+ * A pangram is a sentence where every letter of the English alphabet appears
+ * at least once.
+ *
+ * Given a string sentence containing only lowercase English letters, return
+ * true if sentence is a pangram, or false otherwise.
+ */
+
+/**
+ * @param {string} sentence
+ * @return {boolean}
+ */
+var checkIfPangram = function(sentence) {
+  return new Set([...sentence]).size === 26;
+};