String Play

CodeChefOpen on judge ↗

Given two encoded strings str1 and str2 consisting of lowercase English alphabets and the character ‘#’, decode the string based on the following operation: Whenever a ‘#’ is encountered, increment the previously encountered alphabet by 1 (in a cyclic fashion i.e. a -> b, b -> c, ….., z -> a). Finally, print Yes if both the strings are equal, else print No. Note: Every string will begin with an

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