Largest subsequence

CodeChefOpen on judge ↗

Rahul has assigned a task in alabama university to compute with two strings consisting of lowercase letters.the conditions are as follows for task: Conditions: 1.) He has to find the lengthiest common sub-sequence in two strings. 2.) The sub-sequence should contains only vowel letters. ### Input - 1st line String S1 - 2nd line String S2 ### Output Print the length of longest common sub-Stri

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