It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) . ... we ...

Longest Common Subsequence (LCS): A sequence that appears in the same relative order within multiple strings, indicating a measure of similarity. Dynamic Programming: ...