[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

strings/longest_common_subsequence.py

@@ -2,6 +2,7 @@
 # This program finds the Longest Common Subsequence (LCS) between two strings
 # using Dynamic Programming and also prints the actual LCS string.
 
+
 def longest_common_subsequence(X: str, Y: str):
     m, n = len(X), len(Y)
     dp = [[0] * (n + 1) for _ in range(m + 1)]
@@ -28,7 +29,7 @@ def longest_common_subsequence(X: str, Y: str):
             j -= 1
 
     lcs.reverse()
-    lcs_str = ''.join(lcs)
+    lcs_str = "".join(lcs)
 
     # Print DP table (for visualization)
     print("DP Table:")