Lively Strings

CodeChefOpen on judge ↗

Problem description. Given a string S of length N, you need to tell whether it is lively or not. A lively string is one where the separation between any two nearby character is precisely 1. Consider that the letters in order are organized in cyclic way from 'a' to 'z'. Thus, separate between any character 'i' and 'j' will be characterized as least number of steps it takes 'i' to achieve 'j'. Here

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