SET OF STRINGS

CodeChefOpen on judge ↗

Naman and Pratik are playing a game as follows. Initially Naman has a set of strings S1 of size N1 and Pratik has a set S2 of size N2. Now they play alternatively and select a string from their respective sets and insert it into a set S if it satisfies the following conditions – - If Naman has selected a string from set ,S1 to insert into set S then LCS(Longest Common Subsequence of this string w

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