Longest Common Subsequence | DP-4 - GeeksforGeeks
A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.
Longest Common Subsequence (LCS) - GeeksforGeeks Courses Tutorials Interview Prep DSA Tutorial Interview Questions Quizzes Must Do Advanced DSA System Design Aptitude Puzzles Interview Corner DSA Python Longest Common Subsequence (LCS) Last Updated : 13 Apr, 2026 Given two strings, s1 and s2 , find the length of the Longest Common Subsequence. If there is no common subsequence , return 0 . A subsequence is a string generated from the original string by deleting 0 or more characters, without changing the relative order of the remaining characters. For example, subsequences of "ABC" are "", "A",
related reading
- Aho-Corasick Algorithm for Pattern Searching - GeeksforGeeksgeeksforgeeks.org
- Pattern Searching using Suffix Tree - GeeksforGeeksgeeksforgeeks.org
- Teach Yourself Computer Scienceteachyourselfcs.com
- Compressed Tries - GeeksforGeeksgeeksforgeeks.org
- Levenshtein distance - Wikipediaen.wikipedia.org
- Ukkonen's Suffix Tree Algorithm (Python, C++ & Java code)favtutor.com
- Notes - Suffix Treevisualgo.net
- Competitive Programmer's Handbookcses.fi
- How to overcome Time Limit Exceed(TLE) - GeeksforGeeksgeeksforgeeks.org
- LeetCode-Solutions/0001-1000.md at master · Holychung/LeetCode-Solutionsgithub.com
- Trie Data Structure - GeeksforGeeksgeeksforgeeks.org
- CSC 151 - Recursion Over Listseikmeier.sites.grinnell.edu