#219

Longest Substring with At Most K Distinct

MediumHashing

Solve the classic problem: "Longest Substring with At Most K Distinct". This is a medium Hashing problem commonly asked in placement interviews at top tech companies. Read the examples carefully and think about edge cases before coding your solution.

Examples

Input: Example input goes here

Output: Expected output

Walk through the logic step by step.

Input: Second test case

Output: Another expected output

class Solution:
    def longestSubstringwithAtMostKDistinct(self):
        # Write your solution here
        pass

Output

Run your code to see output here.