Longest substring with k distinct

Given a string s and integer k, return the length of the longest substring that contains at most k distinct characters. If k is 0, the answer is 0. Constraints: 0 <= len(s) <= 5*10^4, 0 <= k <= 26, s is lowercase letters.