Skip to content
Programmingoneonone
Programmingoneonone
  • CS Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
    • Cybersecurity
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programmingoneonone
Programmingoneonone

HackerEarth Complete String problem solution

YASH PAL, 31 July 2024
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

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;

}
coding problems solutions

Post navigation

Previous post
Next post
CLOSE ADS
CLOSE ADS

Pages

  • About US
  • Contact US
  • Privacy Policy

Follow US

  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2026 Programmingoneonone | WordPress Theme by SuperbThemes