solves maximum number of words you can type

Author: anishLearnsToCode

README.md

@@ -465,7 +465,7 @@
 | 1925 | [Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples)                                                                        |                                                             [![Java](assets/java.png)](src/CountSquareSumTriplets.java)                                                              |                                                                                                                                   |
 | 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array)                                                                            |                                                              [![Java](assets/java.png)](src/ConcatenationOfArray.java)                                                               |                                                                                                                                   |
 | 1933 | 🔒 [Check If String Is Decomposable Into Value EqualSubstrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substring) |                                                                                                                                                                                      |                                                                                                                                   |
-| 1935 | [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type)                                                |                                                                                                                                                                                      |                                                                                                                                   |
+| 1935 | [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type)                                                |                                                         [![Java](assets/java.png)](src/MaximumNumberOfWordsYouCanType.java)                                                          |                                                                                                                                   |
 | 1941 | [Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences)        |                                                                                                                                                                                      |                                                                                                                                   |
 | 1945 | [Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert)                                              |                                                                                                                                                                                      |                                                                                                                                   |
 | 1952 | [Three Divisors](https://leetcode.com/problems/three-divisors)                                                                                            |                                                                                                                                                                                      |                                                                                                                                   |

src/MaximumNumberOfWordsYouCanType.java

@@ -0,0 +1,31 @@
+// https://leetcode.com/problems/maximum-number-of-words-you-can-type
+// T: O(|brokenLetters| + |text|)
+// S: O(1)
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class MaximumNumberOfWordsYouCanType {
+    public int canBeTypedWords(String text, String brokenLetters) {
+        final Set<Character> brokenCharacters = getCharacters(brokenLetters);
+        int words = 0;
+        boolean canType = true;
+        for (int i = 0 ; i < text.length() ; i++) {
+            if (text.charAt(i) == ' ') {
+                if (canType) words++;
+                canType = true;
+            } else if (brokenCharacters.contains(text.charAt(i))) {
+                canType = false;
+            }
+        }
+        return words + (canType ? 1 : 0);
+    }
+
+    private Set<Character> getCharacters(String s) {
+        final Set<Character> set = new HashSet<>();
+        for (int i = 0 ; i < s.length() ; i++) {
+            set.add(s.charAt(i));
+        }
+        return set;
+    }
+}