A crucial character

CodeChefOpen on judge ↗

Given a string $s$ consisting of only lowercase characters. You can perform following operation exactly once: - Choose any character from the English alphabets and remove some (or all) occurrences of this alphabet from the given string. What is the smallest length of the string that you can obtain. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow

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