Largest Substring Between Two Equal Characters LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxLengthBetweenEqualCharacters(string s) {
4
    vector<int> v(26, -1);
5
    int maxi = -1;
6

7
    for (int i = 0; i < s.size(); i++) {
8
      if (v[s[i] - 'a'] == -1)
9
        v[s[i] - 'a'] = i;
10
      else
11
        maxi = max(maxi, abs(v[s[i] - 'a'] - i) - 1);
12
    }
13

14
    return maxi;
15
  }
16
};