Add problem 1935: Maximum Number of Words You Can Type

Author: Spxg

src/lib.rs

@@ -635,6 +635,7 @@ pub mod problem_1880_check_if_word_equals_summation_of_two_words;
 pub mod problem_1903_largest_odd_number_in_string;
 pub mod problem_1920_build_array_from_permutation;
 pub mod problem_1929_concatenation_of_array;
+pub mod problem_1935_maximum_number_of_words_you_can_type;
 pub mod problem_1961_check_if_string_is_a_prefix_of_array;
 pub mod problem_1962_remove_stones_to_minimize_the_total;
 pub mod problem_2032_two_out_of_three;

src/problem_1935_maximum_number_of_words_you_can_type/iterative.rs

@@ -0,0 +1,27 @@
+pub struct Solution;
+
+impl Solution {
+    pub fn can_be_typed_words(text: String, broken_letters: String) -> i32 {
+        let mut broken = [false; 26];
+        for byte in broken_letters.bytes() {
+            broken[(byte - b'a') as usize] = true;
+        }
+        text.split(' ')
+            .filter(|s| !s.bytes().any(|x| broken[(x - b'a') as usize]))
+            .count() as _
+    }
+}
+
+impl super::Solution for Solution {
+    fn can_be_typed_words(text: String, broken_letters: String) -> i32 {
+        Self::can_be_typed_words(text, broken_letters)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_1935_maximum_number_of_words_you_can_type/mod.rs

@@ -0,0 +1,25 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn can_be_typed_words(text: String, broken_letters: String) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (("hello world", "ad"), 1),
+            (("leet code", "lt"), 1),
+            (("leet code", "e"), 0),
+        ];
+
+        for ((text, broken_letters), expected) in test_cases {
+            assert_eq!(
+                S::can_be_typed_words(text.to_string(), broken_letters.to_string()),
+                expected,
+            );
+        }
+    }
+}