Most frequent substring under length and distinct-letter limits

Given a string, consider only substrings whose length lies between a minimum and a maximum and that contain at most a given number of distinct letters. Return how many times the most frequent such substring occurs. Explain why checking only substrings of the minimum length is enough, and the cost of your counting.