✅ Python Hashmap Easy Approach ✅
Code\n\nclass Solution:\n    def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int:\n        d = defaultdict(int)\n\n        for i in ra
# Code\n```\nclass Solution:\n    def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int:\n        d = defaultdict(int)\n\n        for i in range(0, len(s)-minSize+1):\n            if len(set((t:=s[i:minSize+i]))) <= maxLetters: d[t] += 1\n\n        return max(d.values()) if d else 0\n        \n```
['Hash Table', 'String', 'Python3']