/* author : ~swim~ date : 21-may-2018 description : [ASSIGNMENT] The Holoalphabetic Sentence A pangram, or holoalphabetic sentence, is a sentence that contains all of the letters of Alphabet at least once. (Which means all letters from a to z) Task: Take a string as an input and check if it is a holoalpabetic sentence or not. Example: The following sentence is a holoalphabetic sentence: "The quick brown fox jumps over the lazy dog" Note : It's better if you put few examples inside your code Bonus Task: Find out how many times each latter is repeated in the sentence. Input: Emter string and press submit. Stats for pre-configured data will be dispayed, even if input is empty. */ #include #include #include #include using namespace std; int main() { string in; getline(cin, in); if(in.empty()){ cout << "input cannot be empty!\n"; } if(!in.empty() && in.size() < 26) { cout << in << " is not Holoalphabetic Sentence !\n"; } auto Evaluate=[](string_view in) { // character counter map freq; for(auto c:in) if(isalnum(c)) freq[tolower(c)]++; bool isHoloa; cout << "is \"" << in << "\" a Holoalphabetic Sentence ?: " << (freq.size() < 26 ? (isHoloa=false, "N0\n") : (isHoloa=true, "YES\n\nDisplaying each character count :\n\n")); cout << boolalpha; if(isHoloa) for(auto c:freq) cout << c.first << " => " << c.second <<"\n"; cout << "\n"; };// end Evaluate cout << endl; cout << "Displaying stats for user and preconfigured data\n\n"; Evaluate(in); Evaluate("The quick brown fox jumps over the lazy dog"); Evaluate("abcdefGHijklmnopQrstuvwxyz"); Evaluate("The quick brown fox jumps oer the lazy o"); }// end main

Holoalphabetic Sentence.cpp