Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

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.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.