abc063/abc063_b.cpp
///////////////////
// Use a boolean map of 26 character array of bools to keep track
Use a boolean map of 26 character array of bools to keep track
Use a boolean map of 26 character array of bools to keep track
void solve() {
    unordered_map<char, bool> uniqc;
    string s;
    cin >> s;
    for (auto x : s) {
        if (uniqc.find(x) != uniqc.end()) {
            return (void)(cout << "no");
        }
        uniqc[x] = true;
    }
    cout << "yes";
}
void solve ( ) { unordered_map < char , bool > uniqc ; string s ; cin >> s ; for ( auto x : s ) { if ( uniqc . find ( x ) != uniqc . end ( ) ) { return ( void ) ( cout << " " ) ; } uniqc [ x ] = true ; } cout << " " ; }
Use a boolean map of 26 character array of bools to keep track
Use a boolean map of 26 character array of bools to keep track