Help Superman

CodeChefOpen on judge ↗

Help Superman Superman was giving a test and he encounter one question in exam, he wants your help Please help him to find the solution of that question. A name is consider as a Subname of a another name if it can be formed by characters present in other name. Given two names of equal length, what's the longest name that can be constructed such that it is a Subname of both? For example,

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