LEGO III

CodeChefOpen on judge ↗

Problem description. LEGO III, A computer which has strings stored in it. Ram, to improve his vocabulary, speaks with the LEGO III . So, LEGO III matches the word spoke by Ram with the stored string S and checks for the maximum match. The maximum match is to be calculated. The string stored can be numeric, alphabetic or alphanumeric. Note: There can be more than one maximum match, in such a case

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