Maximum Number of Words You Can Type — LeetCode 1935 Python Solution

EasyHash TableString
Problem
#1935
Pattern
Hash Map
Reading time
2 min

The problem

There is a malfunctioning keyboard where some letter keys do not work. All other keys on the keyboard work properly.

Example

Input
text = "hello world", brokenLetters = "ad"
Output
1
Explanation
We cannot type "world" because the 'd' key is broken.

Python solution

Python
class Solution:
    def canBeTypedWords(self, text: str, brokenLetters: str) -> int:
        s = set(brokenLetters)
        return sum(all(c not in s for c in w) for w in text.split())

Complexity

MeasureComplexity
TimeO(n)
SpaceO(|\Sigma|), where n is the length of the string text, and |\Sigma| is the size of the alphabet auxiliary

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1935. Maximum Number of Words You Can Type is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Hash Table.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems

Frequently asked questions

How hard is LeetCode 1935. Maximum Number of Words You Can Type?
LeetCode 1935. Maximum Number of Words You Can Type is rated Easy on LeetCode.
What is the time complexity of LeetCode 1935. Maximum Number of Words You Can Type?
The Python solution on this page runs in O(n).
What is the space complexity of LeetCode 1935. Maximum Number of Words You Can Type?
The Python solution on this page uses O(|\Sigma|), where n is the length of the string text, and |\Sigma| is the size of the alphabet auxiliary space.
What topics does LeetCode 1935. Maximum Number of Words You Can Type cover?
LeetCode 1935. Maximum Number of Words You Can Type is tagged Hash Table and String on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity — invisible to screen sharing.

Get Stealth Interview