Longest Common Subsequence
Last updated
What is Longest Common Subsequence?
Given two strings, find the length of their longest common subsequence. If characters match, you extend the LCS from the diagonal; otherwise you take the best from dropping one character in either string. This is the canonical 2D DP problem and teaches you how a 2D table captures the relationship between two sequences simultaneously.
Free resources to learn Longest Common Subsequence
More in stage 17: D Dynamic Programming
Longest Common Subsequence: common questions
Can I learn Longest Common Subsequence in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Longest Common Subsequence in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Longest Common Subsequence tutorial for beginners?
It is lesson 105 of 137 in the free LeetCode roadmap, in stage 17, D Dynamic Programming. If you are new to LeetCode, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.