Raghu Strings

CodeChefOpen on judge ↗

Chef has two strings, $A$ and $B$, of sizes $n$ and $m$ respectively. Chef wants to send these strings to his friends, but sending long strings is expensive. So, Chef comes up with a plan. Chef wants to find a string $C$ such that both $A$ and $B$ are substrings of $C$. Also, Chef wants $C$ to be as short as possible. Can you help Chef find the minimum size of $C$? Input: - The first line cont

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