Codechef Minimise LCS Solution

  

Problem Link:  https://www.codechef.com/problems/MINLCS 

Solution in C++:

/// La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

/// Abul Hasnat  Tonmoy

/// Department of CSE,23rd batch

/// Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************/

#include <bits/stdc++.h>

using namespace std;

void solve()

{

    string s1,s2;

    int n;

    cin>>n>>s1>>s2;

    map<char,int>mp1,mp2;

    for(int i=0; i<n; i++)

    {

        mp1[s1[i]]++;

        mp2[s2[i]]++;

    }

    int ans=0;

    for(char i='a';i<='z';i++)

    {

        ans=max(ans,min(mp1[i],mp2[i]));

    }

    cout<<ans<<endl;

}

signed main()

{

    int t,n;

    cin>>t;

    while(t--)

    {

        solve();

    }

}