Longest Substring With At Most K Distinct Characters
Medium
Hashing
Given a string s and an integer k, print the length of the longest substring that contains at most k distinct characters.
Constraints
1 <= len(s) <= 5 * 10^4 0 <= k <= 50
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.