Sherlock Challenges

CodeChefOpen on judge ↗

Sherlock gives a challenge to Watson. Sherlock gives Watson a string $S$. Watson has to find out the number of times he can spell "$sherlock$" using elements from the string $S$. - The string $S$ contains only lower-case characters. Each character from the string $S$ can be selected only once and the characters can be chosen in any order. ### Input - First line will contain $T$, number

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