There is a malfunctioning keyboard where some letter keys do not work. All other keys on the keyboard work properly.<\/p>\n\n\n\n
Given a string Example 1:<\/strong><\/p>\n\n\n\n Example 2:<\/strong><\/p>\n\n\n\n Example 3:<\/strong><\/p>\n\n\n\n Constraints:<\/strong><\/p>\n\n\n\n Time complexity: O(n) 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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70],"tags":[232,222,82,4],"class_list":["post-9298","post","type-post","status-publish","format-standard","hentry","category-hashtable","tag-bitset","tag-easy","tag-hashtable","tag-string","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9298","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=9298"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9298\/revisions"}],"predecessor-version":[{"id":9300,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/9298\/revisions\/9300"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=9298"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=9298"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=9298"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}text<\/code> of words separated by a single space (no leading or trailing spaces) and a string brokenLetters<\/code> of all distinct<\/strong> letter keys that are broken, return the number of words<\/strong> in<\/em> text<\/code> you can fully type using this keyboard<\/em>.<\/p>\n\n\n\nInput:<\/strong> text = \"hello world\", brokenLetters = \"ad\"\nOutput:<\/strong> 1\nExplanation:<\/strong> We cannot type \"world\" because the 'd' key is broken.\n<\/pre>\n\n\n\n
Input:<\/strong> text = \"leet code\", brokenLetters = \"lt\"\nOutput:<\/strong> 1\nExplanation:<\/strong> We cannot type \"leet\" because the 'l' and 't' keys are broken.\n<\/pre>\n\n\n\n
Input:<\/strong> text = \"leet code\", brokenLetters = \"e\"\nOutput:<\/strong> 0\nExplanation:<\/strong> We cannot type either word because the 'e' key is broken.\n<\/pre>\n\n\n\n
1 <= text.length <= 104<\/sup><\/code><\/li>0 <= brokenLetters.length <= 26<\/code><\/li>text<\/code> consists of words separated by a single space without any leading or trailing spaces.<\/li>brokenLetters<\/code> consists of distinct<\/strong> lowercase English letters.<\/li><\/ul>\n\n\n\nSolution: Hashset \/ bitset<\/strong><\/h2>\n\n\n\n
Space complexity: O(1)<\/p>\n\n\n\nC++<\/h2>\n
\n\/\/ Author: Huahua\nclass Solution {\npublic:\n int canBeTypedWords(string text, string brokenLetters) {\n const int n = text.size();\n \n bitset<26> b;\n for (char c : brokenLetters) b.set(c - 'a');\n \n int ans = 0;\n for (int i = 0, broken = 0; i <= n; ++i) {\n if (i == n || text[i] == ' ') {\n if (!broken) ++ans;\n broken = 0;\n } else {\n broken |= b[text[i] - 'a'];\n }\n }\n \n return ans;\n }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"