Pangram Bitmask Report
Preview mode. Log in to edit, run, submit, and save progress.
Easy
Pangram Bitmask Report
A text checker receives several sentences. For each sentence, decide whether it contains every English letter from a to z at least once. Return a string of bits where the i-th bit is 1 if the i-th sentence is a pangram, otherwise 0.
Examples
Example 1
Input:
2 The quick brown fox jumps over the lazy dog Hello world
Output:
10
Explanation: The first sentence is a pangram, while the second is not.
Approach hint
Ignore spaces and letter case.
Common mistake
Skipping assumptions, edge cases, or trade-offs can make an otherwise good answer feel incomplete.
solution.cpp