Write a function max$\_$unique$\_$substring$($s$,$k$)$ that returns the length of the longest substring of a string s that contains exactly k unique characters. If there is no substring with exactly k unique characters, return $0.$

Note:

k is an integer.

s only contains lowercase English letters.

len$($s$)>=1,$ k $>=1.$