chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Easy/2025-09-15-1935-Maximum-Number-of-Words-You-Can-Type/explanation.md

@@ -0,0 +1,34 @@
+# Maximum Number of Words You Can Type (Easy)
+
+**Problem ID:** 1935  
+**Date:** 2025-09-15  
+**Link:** https://leetcode.com/problems/maximum-number-of-words-you-can-type/
+
+## Approach
+
+To solve the problem of determining the maximum number of words that can be fully typed with a malfunctioning keyboard, we can follow a straightforward approach:
+
+### Approach:
+
+1. **Input Parsing**: Split the input string `text` into individual words using space as a delimiter. This can be easily achieved using the built-in string split function.
+
+2. **Broken Letters Representation**: Convert the string `brokenLetters` into a set for efficient membership checking. This allows us to quickly determine if any character in a word is broken.
+
+3. **Word Validation**: For each word in the list of words obtained from `text`, check if it can be fully typed. This involves iterating through each character of the word and checking if it exists in the set of broken letters. If a character is found in the set, the word cannot be typed.
+
+4. **Counting Valid Words**: Maintain a counter to keep track of the number of words that can be fully typed. Increment this counter for each word that passes the validation check.
+
+5. **Output the Result**: Finally, return the count of valid words.
+
+### Main Idea:
+The key idea is to leverage the efficiency of set lookups to quickly determine if any characters in a word are broken. This allows us to validate each word in linear time relative to its length.
+
+### Data Structures:
+- **List**: To store the words from the input string `text`.
+- **Set**: To store the broken letters for O(1) average time complexity on membership tests.
+
+### Complexity:
+- **Time Complexity**: O(n * m), where n is the number of words in `text` and m is the average length of the words. This is because we check each character of each word against the set of broken letters.
+- **Space Complexity**: O(k), where k is the number of distinct broken letters (at most 26), for storing the set of broken letters.
+
+This approach is efficient given the constraints and effectively counts the number of words that can be typed with the malfunctioning keyboard.

Easy/2025-09-15-1935-Maximum-Number-of-Words-You-Can-Type/solution.java

@@ -0,0 +1,26 @@
+class Solution {
+    public int canBeTypedWords(String text, String brokenLetters) {
+        Set<Character> brokenSet = new HashSet<>();
+        for (char c : brokenLetters.toCharArray()) {
+            brokenSet.add(c);
+        }
+        
+        String[] words = text.split(" ");
+        int count = 0;
+        
+        for (String word : words) {
+            boolean canType = true;
+            for (char c : word.toCharArray()) {
+                if (brokenSet.contains(c)) {
+                    canType = false;
+                    break;
+                }
+            }
+            if (canType) {
+                count++;
+            }
+        }
+        
+        return count;
+    }
+}

Easy/2025-09-15-1935-Maximum-Number-of-Words-You-Can-Type/solution.js

@@ -0,0 +1,13 @@
+var canBeTypedWords = function(text, brokenLetters) {
+    const brokenSet = new Set(brokenLetters);
+    const words = text.split(' ');
+    let count = 0;
+
+    for (const word of words) {
+        if (![...word].some(char => brokenSet.has(char))) {
+            count++;
+        }
+    }
+
+    return count;
+};

Easy/2025-09-15-1935-Maximum-Number-of-Words-You-Can-Type/solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def canBeTypedWords(self, text: str, brokenLetters: str) -> int:
+        broken_set = set(brokenLetters)
+        words = text.split()
+        count = 0
+        
+        for word in words:
+            if not any(char in broken_set for char in word):
+                count += 1
+        
+        return count

README.md

@@ -148,3 +148,4 @@ Each problem includes:
 - 2025-09-12 — [Vowels Game in a String](https://leetcode.com/problems/vowels-game-in-a-string/) (Medium) → `Medium/2025-09-12-3227-Vowels-Game-in-a-String`
 - 2025-09-13 — [Find Most Frequent Vowel and Consonant](https://leetcode.com/problems/find-most-frequent-vowel-and-consonant/) (Easy) → `Easy/2025-09-13-3541-Find-Most-Frequent-Vowel-and-Consonant`
 - 2025-09-14 — [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) (Medium) → `Medium/2025-09-14-966-Vowel-Spellchecker`
+- 2025-09-15 — [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/) (Easy) → `Easy/2025-09-15-1935-Maximum-Number-of-Words-You-Can-Type`