Ositus

#include <bits/stdc++.h>

using namespace std;

int main() {
    string str; cin >> str;
    vector<int> pointsRight(str.length(), 0);
    unordered_set<char> seen;

    auto ita = str.rbegin();
    auto itb = ita+1;

    while (ita < str.rend()) {
        int bi = str.rend()-itb-1;

        if (seen.find(*itb) == seen.end() && itb != str.rend()) {
            if (seen.size() == 0) seen.insert(*ita);

            seen.insert(*itb);
            pointsRight[bi] += 1;
            ++itb;
        } else {
            ++ita;
            itb = ita+1;
            seen.clear();
        }
    }

    // cumulative sum
    for (int i = pointsRight.size()-1; i >= 0; --i) pointsRight[i] += pointsRight[i+1];

    int result = 0;
    auto itc = str.begin();
    auto itd = itc+1;

    seen.clear();

    while (itc < str.end()) {
        int di = distance(str.begin(), itd);

        if (seen.find(*itd) == seen.end() && itd < str.end()) {
            if (seen.size() == 0) {
                seen.insert(*itc);
                ++result;
            }

            seen.insert(*itd);
            result += pointsRight[di+1]+1;
            ++itd;
        } else {
            ++itc;
            itd = itc+1;
            seen.clear();
        }
    }

    ++result;

    cout << result%1000000007 << endl;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: WRONG ANSWER