Three Strings

CodeChefOpen on judge ↗

You are given three strings $A, B, C$. You want to find a string $Z$ (possibly empty) such that the string $A + Z + B$ contains $C$ as a substring. Find out the smallest possible length of string $A + Z + B$ that can satisfy the above criteria. ### Input - The first line of the input contains an integer $T$ denoting the number of test cases. The description of the test cases follows. - Each tes

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