Karthik and Strings

CodeChefOpen on judge ↗

Karthik is fond of some lower case alphabets but not all. One day, he got a ring of *n* alphabets. He started from a random character and started noting down the characters in the clockwise direction in a paper. Now you have got that paper. You have to say whether karthik has found out a *contiguous subsequence* where each of his favourite characters occurs exactly once. ###Input format: - The

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