Mario and Strings

CodeChefOpen on judge ↗

Mario has stopped playing games and has started coding. While solving a few problems he realized that he is not good with strings and is stuck on a problem which he wants you to solve for him. The problem is as follows: Given a string S consisting of small English alphabets, your job is to find the longest "weird" sub-sequence. The subsequence is said to be "weird" if it consists of two charac

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