weeok 08 solution longest common seq

Author: HYUNAHKO

longest-common-subsequence/HYUNAHKO.py

@@ -0,0 +1,17 @@
+class Solution:
+    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
+        # Dynamic programming 
+        n = len(text1)
+        m = len(text2)
+
+        # text1 - col, text2 - row
+        dp= [[0] * (n+1) for _ in range(m+1)]
+
+        for i in range(1, m+1):
+            for j in range(1, n+1):
+                if text2[i-1] == text1[j-1]:
+                    dp[i][j] = dp[i-1][j-1] + 1
+                else:
+                    dp[i][j] = max(dp[i-1][j], dp[i][j-1])
+
+        return dp[m][n]