Given a string, find the longest substring with k distinct characters.
e.g – “aaaabbbb”, k = 2, “aaaabbbb”
“asdfrttt” k = 3, “asd”, “frttt”
Given a string, find the longest substring with k distinct characters.
e.g – “aaaabbbb”, k = 2, “aaaabbbb”
“asdfrttt” k = 3, “asd”, “frttt”
Fill in the form below to book a 30 min no-obligation consulting session.