Subtract the input

CodeChefOpen on judge ↗

Link to image Look at the INPUT and image carefully. Print the number of permutation of remaining set, modulo SUM OF 10^9 and 7 ( i.e 10^9+7). Input - First line contains the number of test cases T. - Next T lines contains an alphanumeric string consisting of distinct characters. Output For each test case, output a single line consisting of a non-negative integer. Constraints -

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