AAshirinashirmehmood.hashnode.dev·May 22, 2024 · 1 min read3090. Maximum Length Substring With Two Occurrencesclass Solution { public: int maximumLengthSubstring(string s) { int m1[26]{}; int count = 0; // sliding window part for(int l = 0, r = 0; r < s.length(); ++r) { int a = s[r] - 'a'; ...00