Special Substrings

CSESAdditional Problems IOpen on judge ↗

A substring is called special if every character that appears in the string appears the same number of times in the substring. Your task is to count the number of special substrings in a given string. Input The only input line has a string of length n. Every character is between a...z. Output Print one integer: the number of special substrings. Constraints - 1 \le n \le 2 \cdot 10^5 Exampl

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