We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. String Construction
  5. Discussions

String Construction

  • alban_tyrex
     + 0 comments

    The solution here is to count the number of unique occurrences of the characters, here is the explanation : https://youtu.be/UqqNcIUnsv8

    solution 1 : using map

    int stringConstruction(string s) {
    map<char, int> mp;
    int r = 0;
    for(int i = 0; i < s.size(); i++) if(!mp[s[i]]){
        mp[s[i]] = 1; r++;
    }
    return r;
}

    solution 2 : using set

    int stringConstruction(string s) {
    set<char> se(s.begin(), s.end());
    return se.size();
}