Distinct Subsequences

CSESString AlgorithmsOpen on judge ↗

You are given a string. You can remove any number of characters from it, but you cannot change the order of the remaining characters. How many different strings can you generate? Input The first input line contains a string of size n. Each character is one of a–z. Output Print one integer: the number of strings modulo 10^9+7. Constraints - 1 \le n \le 5 \cdot 10^5 Example Input: aybabtu

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