[LeetCode]#1935. Maximum Number of Words You Can Type

Environment: Python 3.8

Key technique: set, &, split

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

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

Example 1:

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

Analysis:

1. Convert string brokenLetters “ad” to {ad}
2. Use split function and convert text “hello world” to [‘’hello”, “world”]
3. Find the intersection between text and brokenLetters. If yes, temp value +1.
4. The length in text (after split)-temp value is answer.

Solution:

class Solution:
    def canBeTypedWords(self, text, brokenLetters):
        t=set(brokenLetters)
        b=0
        for i in text.split():
            if (len(set(i) & t) >0):
                b=b+1
        return len(text.split())-b

Submissions:

Reference:

https://leetcode.com/problems/maximum-number-of-words-you-can-type/discuss/1349366/Python-a-fast-one-liner