Substrings and Repetitions
Statement Given a string S and several frequencies Fi. For each Fi output the number of substrings of S (the characters of substring should be contiguous) that occur at least Fi times in S. Note, that we consider two substrings distinct if they have distinct length, or they have distinct starting indices. Input The first line of input contains integer T, the number of test cases. The first li
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start