Given two strings S and T, the task is to find the minimum number of characters to be deleted from the beginning of these strings to make the two strings identical.
Two empty strings will always be an identical strings.
Input: S = “geeksforgeeks” T = “peeks”
Substring “geeksforg” from S and “p” from T are deleted to make both the strings equals to “eeks”
Input: S = “geeksforgeeks” T = “code”
Both the strings had to be deleted completely.
Traverse both the strings simultaneously from the end and compare the characters of the two strings. The first indices i (index of S1) and j (index of S2) where the characters of the two strings differ is the length up to which the characters of S1 and S2 need to be deleted. Hence, the final value of i + j is the required answer.
Below is the implementation of the above approach:
Time Complexity: O( min(len(S1), len(S2)) )
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Minimum characters to be deleted from the end to make given two strings equal
- Number of character corrections in the given strings to make them equal
- Length of longest substring to be deleted to make a string equal to another string
- Number of ways to divide string in sub-strings such to make them in lexicographically increasing sequence
- Count columns to be deleted to make each row sorted
- Check whether two strings can be made equal by reversing substring of equal length from both strings
- Minimum number of given operations required to make two strings equal
- Find the minimum number of preprocess moves required to make two strings equal
- Minimum swaps to make two strings equal by swapping only with third string
- Minimum number of operations required to make two strings equal
- Minimum characters to be replaced to make frequency of all characters same
- Minimum operations to make frequency of all characters equal K
- Minimum move to end operations to make all strings equal
- Check whether two strings can be made equal by copying their characters with the adjacent ones
- Count of characters in str1 such that after deleting anyone of them str1 becomes str2
- Count of strings that become equal to one of the two strings after one removal
- Remove minimum number of characters so that two strings become anagram
- Sort an Array of Strings according to the number of Vowels in them
- Sort the strings based on the numbers of matchsticks required to represent them
- Minimum Cost To Make Two Strings Identical
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.