n = int(input())
s = list(map(int, input().split()))
m = int(input())
r = list(map(int, input().split()))

ss = set(s)
sr = set(r)
fs = [x for x in s if x in sr]
fr = [x for x in r if x in ss]

fn, fm = len(fs), len(fr)
if not fn or not fm:
print(0)
exit()

dp = [[0] * (fm + 1) for _ in range(fn + 1)]
for i in range(1, fn + 1):
for j in range(1, fm + 1):
if fs[i-1] == fr[j-1]:
dp[i][j] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])

print(dp[fn][fm])

Network ✔️

#include <bits/stdc++.h>
using namespace std;

int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) cin >> s[i];
int m;
cin >> m;
vector<int> r(m);
for (int i = 0; i < m; i++) cin >> r[i];

set<int> ss(s.begin(), s.end()), sr(r.begin(), r.end());
vector<int> fs, fr;
for (int x : s) if (sr.count(x)) fs.push_back(x);
for (int x : r) if (ss.count(x)) fr.push_back(x);

int fn = fs.size(), fm = fr.size();
if (!fn || !fm) {
cout << 0 << endl;
return 0;
}

vector<vector<int>> dp(fn + 1, vector<int>(fm + 1, 0));
for (int i = 1; i <= fn; i++) {
for (int j = 1; j <= fm; j++) {
if (fs[i-1] == fr[j-1]) dp[i][j] = dp[i-1][j-1] + 1;
else dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
}
}

cout << dp[fn][fm] << endl;
return 0;
}

Network - cpp ✔️

Add your friends help them to succeed 💯🎉

https://t.me/code_alphix

Cognizant Technical Help available...

✔️ all cluster available

✔️py , Java , csharp

Those who need 💯 test Clearance

DM @Mrtrueliving_ix 🎉

Previous helping proofs & placement offers

https://t.me/code_alphix/5976

https://t.me/code_alphix/5947

https://t.me/code_alphix/5869?single