# Question: Given a string s and an integer k, write a function to find the length of the longest substring that contains at most k distinct characters. If k is zero or the string is empty, return 0.