← Questions
Most frequent substring under length and distinct-letter limits
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding