Substring Distribution

CSESString AlgorithmsOpen on judge ↗

You are given a string of length n. For every integer between 1 \ldots n you need to print the number of distinct substrings of that length. Input The only input line has a string of length n that consists of characters a–z. Output For each integer between 1 \ldots n print the number of distinct substrings of that length. Constraints - 1 \le n \le 10^5 Example Input: abab Output: 2 2 2

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