feat: 1143. Longest Common Subsequence

Author: gwbaik9717

longest-common-subsequence/gwbaik9717.js

@@ -0,0 +1,30 @@
+// n: len(text1), m: len(text2)
+// Time complexity: O(n * m)
+// Space complexity: O(n * m)
+
+/**
+ * @param {string} text1
+ * @param {string} text2
+ * @return {number}
+ */
+var longestCommonSubsequence = function (text1, text2) {
+  const n = text1.length;
+  const m = text2.length;
+
+  const dp = Array.from({ length: n + 1 }, () =>
+    Array.from({ length: m + 1 }, () => 0)
+  );
+
+  for (let i = 1; i <= n; i++) {
+    for (let j = 1; j <= m; j++) {
+      if (text1[i - 1] === text2[j - 1]) {
+        dp[i][j] = dp[i - 1][j - 1] + 1;
+        continue;
+      }
+
+      dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+    }
+  }
+
+  return dp.at(-1).at(-1);
+};