Chef Starts Coding

CodeChefOpen on judge ↗

Chef has started coding recently. He has 2 files with a string name each with length N and M. The two files have code in them in the same sequence of the name of the file given (imagine the file name is AWD that means the function A is written first then function W is written and then function D is written) . Chef wants to find the number of maximum common function sequences present in both of the

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