1function longestCommonSubsequence(s1, s2) {
2 const m = s1.length, n = s2.length;
3 const dp = Array.from({ length: m + 1 }, () => new Array(n + 1).fill(0));
4 for (let i = 1; i <= m; i++) {
5 for (let j = 1; j <= n; j++) {
6 if (s1[i - 1] === s2[j - 1])
7 dp[i][j] = dp[i - 1][j - 1] + 1;
8 else
9 dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
10 }
11 }
12 return dp[m][n];
13}