Playing With Strings

CodeChefOpen on judge ↗

Given a string $S$, find the $rank$ of the string amongst its permutations sorted lexicographically. Assume that no characters are repeated. ###Input Format: The first line of input contains an integer $T$ denoting the number of test cases. Then $T$ test cases follow. Each test case contains a string $S$ as input. ###Output Format: For each string $S$, print the $rank$ of the string o

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