update readme

Author: hogan-tech

1250-longest-common-subsequence/1250-longest-common-subsequence.py

@@ -10,14 +10,16 @@ def longestCommonSubsequence(self, text1: str, text2: str) -> int:
         T1 = len(text1)
         T2 = len(text2)
         dp = [[0 for _ in range(T2 + 1)] for _ in range(T1 + 1)]
-        for t1 in range(T1):
-            for t2 in range(T2):
-                if text1[t1] == text2[t2]:
-                    dp[t1 + 1][t2 + 1] = dp[t1][t2] + 1
+        for t1 in range(1, T1 + 1):
+            for t2 in range(1, T2 + 1):
+                if text1[t1 - 1] == text2[t2 - 1]:
+                    dp[t1][t2] = dp[t1 - 1][t2 - 1] + 1
                 else:
-                    dp[t1 + 1][t2 + 1] = max(dp[t1][t2 + 1], dp[t1 + 1][t2])
+                    dp[t1][t2] = max(dp[t1 - 1][t2], dp[t1][t2 - 1])
+
         return dp[T1][T2]
 
+
 # time complexity: O(n*m)
 # space compleixty: O(n*m)
 

Python/1143-longest-common-subsequence.py

@@ -115,43 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Array
-|  |
-| ------- |
-| [0327-count-of-range-sum](https://github.com/hogan-tech/leetcode-solution/tree/master/0327-count-of-range-sum) |
-## Binary Search
-|  |
-| ------- |
-| [0327-count-of-range-sum](https://github.com/hogan-tech/leetcode-solution/tree/master/0327-count-of-range-sum) |
-## Divide and Conquer
-|  |
-| ------- |
-| [0327-count-of-range-sum](https://github.com/hogan-tech/leetcode-solution/tree/master/0327-count-of-range-sum) |
-## Binary Indexed Tree
-|  |
-| ------- |
-| [0327-count-of-range-sum](https://github.com/hogan-tech/leetcode-solution/tree/master/0327-count-of-range-sum) |
-## Segment Tree
-|  |
-| ------- |
-| [0327-count-of-range-sum](https://github.com/hogan-tech/leetcode-solution/tree/master/0327-count-of-range-sum) |
-## Merge Sort
-|  |
-| ------- |
-| [0327-count-of-range-sum](https://github.com/hogan-tech/leetcode-solution/tree/master/0327-count-of-range-sum) |
-## Ordered Set
-|  |
-| ------- |
-| [0327-count-of-range-sum](https://github.com/hogan-tech/leetcode-solution/tree/master/0327-count-of-range-sum) |
-## String
-|  |
-| ------- |
-| [1250-longest-common-subsequence](https://github.com/hogan-tech/leetcode-solution/tree/master/1250-longest-common-subsequence) |
-## Dynamic Programming
-|  |
-| ------- |
-| [1250-longest-common-subsequence](https://github.com/hogan-tech/leetcode-solution/tree/master/1250-longest-common-subsequence) |
-<!---LeetCode Topics End-->