Contiguous Substring

CodeChefOpen on judge ↗

Given two strings A and B, find the maximum contiguous sequence of letters in both the strings. Input First line contains an integer T, number of test cases. Each test case has two lines. The input will consist of two strings composed only of letters a..z, both of which are at most 100,0000 characters in length. Output Print the contiguous sequence of letters in both the strings and in the ne

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