LCS and Variations
The longest common subsequence of two strings is the length of the longest subsequence, which is common to both the given strings. It is a classical DP problem and thus has different variations, including Longest common substring, Shortest common supersequence, the Longest palindromic subsequence, etc. All these problems have similar code structures and fall under the category of LCS.
Longest Common Subsequence
By Raksha Jain
● Published At Dec 2021
The blog discusses in detail the Longest Common Subsequence. We’ll discuss many approaches to solve the problem and time and space complexity for each method.... Keep reading ..
Longest common substring
By Riya
● Published At Feb 2022
This article will discuss the Longest Common Substring problem and various ways to solve it, from the brute force solution to the dynamic programming solution and their space and time complexities.... Keep reading ..
Longest Palindromic Subsequence
By Nishant Rana
● Published At Oct 2021
In this blog, we will cover the question of finding the Longest Palindromic Subsequence and discussion over its Time and Space complexity.... Keep reading ..
Minimum insertion to convert the string to a palindrome
By Nishant Rana
● Published At Oct 2021
This blog will see how to calculate the minimum number of insertions to convert the given string to a palindrome string along with the discussion in time and space complexities.... Keep reading ..
Longest Repeating Subsequence
By Riya
● Published At Jan 2022
This article will discuss the Longest Repeating Subsequence problem and various ways to solve it, starting from the brute force solution to dynamic programming solution and their space and time complexities.... Keep reading ..
LCS of 3 strings
By Saksham Gupta
● Published At Dec 2021
In this blog, we will discuss the extension of LCS of two strings and will see how we can calculate LCS of 3 strings.... Keep reading ..
Shortest Common Supersequence
By Deeksha
● Published At Dec 2021
In this blog, we will be discussing the problem shortest Common Supersequence. We will be starting from brute force and will be optimizing it using dynamic programming.... Keep reading ..
Distinct subsequences
By Pranav Gautam
● Published At Nov 2021
Learn to find the occurrence of distinct subsequences in a sequence.... Keep reading ..