1
class Solution {
2
 public:
3
  int findSubstringInWraproundString(string p) {
4
    int ans = 1, prev_ans = 1;
5
    vector<int> arr(26, 0);
6
    arr[p[0] - 'a'] = 1;
7
    for (int i = 1; i < p.size(); i++) {
8
      if ((p[i - 1] - 'a' + 1) % 26 == p[i] - 'a') // Checking for continuation
9
        prev_ans++;
10
      else
11
        prev_ans = 1;
12
      if (arr[p[i] - 'a'] < prev_ans) {
13
        ans += prev_ans - arr[p[i] - 'a'];
14
        arr[p[i] - 'a'] = prev_ans;
15
      }
16
    }
17
    return ans;
18
  }
19
};