Angry Killjee

CodeChefOpen on judge ↗

Killjee is very angry today as he is stuck on a problem. Can you help him solve this problem. Given a string S of length N. You need to answer Q queries. In each query you will get an integer X. You need to find frequency of most frequent sub-string of length X of string S. Input First line of input contains a string S consisting of lowercase alphabets. Second line contains a single integer Q

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.

voice by Sarvam AI