THECHILD

CodeChefOpen on judge ↗

Given two strings a and b of equal length, what's the longest string (S ) that can be constructed such that it is a child of both? A string x is said to be a child of a string y if x can be formed by deleting zero or more characters from y . For example, ``abcd" and ``abdc" has two children with maximum length 3, ``abc" and ``abd" . Note that we will not consider ``abcd" as a common

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