We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Maximum Number of Words You Can Type

Difficulty: Easy

Problem Description

Given a string text of words separated by a single space and a string brokenLetters of all distinct letter keys that are broken, return the number of words in text that you can fully type using this keyboard.

Key Insights

  • We need to count words that do not contain any letters from the brokenLetters string.
  • A word can only be typed if none of its characters are in the set of broken letters.
  • Using a set data structure helps in efficiently checking whether a letter is broken.

Space and Time Complexity

Time Complexity: O(n * m), where n is the number of words in text and m is the average length of the words.
Space Complexity: O(k), where k is the number of broken letters (up to 26).

Solution

The approach involves the following steps:

  1. Split the text string into individual words using space as a delimiter.
  2. Create a set of broken letters for O(1) average time complexity in lookups.
  3. Iterate through each word and check if it contains any broken letters by checking against the set.
  4. Count the number of words that do not contain any broken letters and return this count.

Code Solutions

def canType(text: str, brokenLetters: str) -> int:
    broken_set = set(brokenLetters)  # Create a set of broken letters
    words = text.split()  # Split the text into words
    count = 0  # Initialize count of words that can be typed

    for word in words:
        if not any(letter in broken_set for letter in word):  # Check if any letter is broken
            count += 1  # Increment count if the word can be typed

    return count  # Return the total count of words that can be typed
← Back to All Questions