feat: Solve longest-common-subsequence problem

Author: hu6r1s

longest-common-subsequence/hu6r1s.py

@@ -0,0 +1,15 @@
+class Solution:
+  """
+  문제의 힌트에서 DP를 활용하는 것을 확인
+  """
+  def longestCommonSubsequence(self, text1: str, text2: str) -> int:
+    dp = [[0] * (len(text2)+1) for _ in range(len(text1)+1)]
+
+    for i in range(1, len(text1)+1):
+        for j in range(1, len(text2)+1):
+            if text1[i-1] == text2[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[-1][-1]