Concepts3
⚙️AlgorithmIntermediate
Longest Common Subsequence
The Longest Common Subsequence (LCS) between two sequences is the longest sequence that appears in both, not necessarily contiguously.
#longest common subsequence#lcs#string dp+12
⚙️AlgorithmIntermediate
Edit Distance
Edit distance (Levenshtein distance) measures the minimum number of inserts, deletes, and replaces needed to turn one string into another.
#edit distance#levenshtein#dynamic programming+11
⚙️AlgorithmIntermediate
Dynamic Programming Fundamentals
Dynamic programming (DP) solves complex problems by breaking them into overlapping subproblems and using their optimal substructure.
#dynamic programming#memoization#tabulation+12