Given a string text of words separated by a single space and a string brokenLetters containing distinct characters representing keys on a malfunctioning keyboard, return the total count of words in text that can be fully typed without using any broken key.

A word can be typed if and only if none of its letters are in brokenLetters.

Constraints:

• $1 \le$ text.length $\le 10^4$

• $0 \le$ brokenLetters.length $\le 26$

• text consists of words separated by a single space without any leading or trailing spaces.

• Each word consists only of lowercase English letters.

• brokenLetters consists of distinct lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.