HackerEarth Complete String problem solution

In this HackerEarth Complete String problem solution, A string is said to be complete if it contains all the characters from a to z. Given a string, check if it is complete or not.

HackerEarth Complete String problem solution.

#include<bits/stdc++.h>
using namespace std;
int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin>>t;
    while(t--){

        map<char,int>m;
        string s;
        cin>>s;

        for(int i = 0; i<s.size(); i++){

            m[s[i]]++;

        }

        int count = m.size();
        if(count==26){

            cout<<"YES"<<endl;

        }

        else{

            cout<<"NO"<<endl;

        }

    }

    return 0;

}