World Of Strings
CodeChefOpen on judge ↗
Rohit is brilliant in string problems. One day his friend Manish gave him a problem of string to test his ability. He give him two strings say p and s, s [l, r] denote the substring of s between index l and index r. The frequency of string s in p be the number of times s occurs as a substring in p. A function f (p, s, l, r) is the frequency of the substring s [l, r] in p. Manish gives Rohit a stri
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