Distinct Substrings

CSESString AlgorithmsOpen on judge ↗

Count the number of distinct substrings that appear in a string. Input The only input line has a string of length n that consists of characters a–z. Output Print one integer: the number of substrings. Constraints - 1 \le n \le 10^5 Example Input: abaa Output: 8 Explanation: the substrings are a, b, aa, ab, ba, aba, baa and abaa.

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