Minimise LCS

CodeChefRating 1367Open on judge ↗

Chef is given two strings $A$ and $B$ of length $N$ containing lowercase English letters. Chef can rearrange both the strings in any way he wants. He wants to minimize the length of LCS ([Longest Common Subsequence](https://en.wikipedia.org/wiki/Longest_common_subsequence_problem)) of both the strings. Find the minimum length of LCS of $A$ and $B$ if he optimally rearranges both the strings. ##

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