Maximum Number of Occurrences of a Substring LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxFreq(string s, int maxLetters, int minSize, int maxSize) {
4
    int i, j, k, ans = 0, res, n = s.length();
5

6
    string temp;
7
    unordered_map<char, int> st;
8
    unordered_map<string, int> mp;
9

10
    i = 0, j = 0;
11
    while (i <= n - minSize && j < n) {
12
      temp += s[j];
13
      st[s[j]] += 1;
14
      ;
15
      if (temp.length() == minSize) {
16
        if (st.size() <= maxLetters) mp[temp] += 1;
17
        i += 1;
18
        st[temp[0]] -= 1;
19
        if (st[temp[0]] == 0) st.erase(temp[0]);
20
        temp.erase(temp.begin());
21
      }
22
      j += 1;
23
    }
24
    for (auto el : mp) ans = max(ans, el.second);
25
    return ans;
26
  }
27
};