Skip to content

Commit 57fbe43

Browse files
solves check if sentence is a pangram
1 parent e150333 commit 57fbe43

File tree

2 files changed

+22
-1
lines changed

2 files changed

+22
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -445,7 +445,7 @@
445445
| 1822 | [Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array) | [![Java](assets/java.png)](src/SignOfTheProductOfAnArray.java) | |
446446
| 1826 | 🔒 [Faulty Sensor](https://leetcode.com/problems/faulty-sensor) | | |
447447
| 1827 | [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing) | [![Java](assets/java.png)](src/MinimumOperationsToMakeTheArrayIncreasing.java) | |
448-
| 1832 | [Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram) | | |
448+
| 1832 | [Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram) | [![Java](assets/java.png)](src/CheckIfSentenceIsPangram.java) | |
449449
| 1837 | [Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k) | | |
450450
| 1844 | [Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters) | | |
451451
| 1848 | [Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element) | | |

src/CheckIfSentenceIsPangram.java

+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
// https://leetcode.com/problems/check-if-the-sentence-is-pangram
2+
// T: O(|s|)
3+
// S: O(1)
4+
5+
import java.util.HashSet;
6+
import java.util.Set;
7+
8+
public class CheckIfSentenceIsPangram {
9+
public boolean checkIfPangram(String sentence) {
10+
final Set<Character> letters = getLetters(sentence);
11+
return letters.size() == 26;
12+
}
13+
14+
private Set<Character> getLetters(String s) {
15+
final Set<Character> letters = new HashSet<>();
16+
for (int index = 0 ; index < s.length() ; index++) {
17+
letters.add(s.charAt(index));
18+
}
19+
return letters;
20+
}
21+
}

0 commit comments

Comments
 (0)