GOOD PREFIXES

CodeChefOpen on judge ↗

You are given two strings $S$ and $R$ of sizes $M$ and $N$ respectively where $M \leq N$. For every $prefix$ $P$ of string $S$, you have to find how many substrings of string $R$ have $P$ as the prefix. Find answer for all the $prefixes$ of the string $S$ and print them as space separated integers . ###NOTE: - Large input files , use of $fastio$ is recommended. ###Input Format

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