Game of String

CodeChefOpen on judge ↗

You are given a string $A$ of length $N$. You have to build a string $B$ such that it contains the first occurrence of every alphabet in A in order. Now calculate the number of subsequences in $A$ which are equal to $B$. The string contains only lowercase english alphabets. ###Input: - First line will contain $T$, number of test cases. Then the test cases follow. - First line of each test case

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