Given a string str, the task is to find the sum of the similarities of str with each of its suffixes.
The similarity of strings A and B is the length of the longest prefix common to both the strings i.e. the similarity of “aabc” and “aab” is 3 and that of “qwer” and “abc” is 0.
Input: str = “ababa”
The suffixes of str are “ababa”, “baba”, “aba”, “ba” and “a”. The similarities of these strings with the original string “ababa” are 5, 0, 3, 0 & 1 respectively.
Thus, the answer is 5 + 0 + 3 + 0 + 1 = 9.
Input: str = “aaabaab”
Approach: Compute Z-array using Z-algorithm – For a string str[0..n-1], Z array is of same length as string. An element Z[i] of Z array stores length of the longest substring starting from str[i] which is also a prefix of str[0..n-1]. The first entry of Z array is the length of the string.
Now, sum all the elements of the Z-array to get the required sum of the similarities.
Below is the implementation of the above approach:
# Python3 implmentation of the approach
def getZarr(s, n, Z):
L, R, k = 0, 0, 0
# [L, R] make a window which matches
# with prefix of s
for i in range(n):
# if i>R nothing matches so we will
# calculate Z[i] using naive way.
if i > R:
L, R = i, i
R-L = 0 in starting, so it will start
checking from 0’th index. For example,
for “ababab” and i = 1, the value of R
remains 0 and Z[i] becomes 0. For string
“aaaaaa” and i = 1, Z[i] and R become 5
while R < n and s[R - L] == s[R]: R += 1 Z[i] = R - L R -= 1 else: # k = i-L so k corresponds to number # which matches in [L, R] interval. k = i - L # if Z[k] is less than remaining interval # then Z[i] will be equal to Z[k]. # For example, str = "ababab", i = 3, R = 5 # and L = 2 if Z[k] < R - i + 1: Z[i] = Z[k] else: L = i while R < n and s[R - L] == s[R]: R += 1 Z[i] = R - L R -= 1 def sumSimilarities(s, n): Z = [0 for i in range(n)] # Compute the Z-array for the # given string getZarr(s, n, Z) total = n # summation of the Z-values for i in range(n): total += Z[i] return total # Driver Code s = "ababa" n = len(s) print(sumSimilarities(s, n)) # This code is contributed # by Mohit kumar 29 [tabby title="C#"]
- Concatenate suffixes of a String
- Difference and similarities between HashSet, LinkedHashSet and TreeSet in Java
- Pattern Searching using a Trie of all Suffixes
- Minimal moves to form a string by adding characters or appending string itself
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- String slicing in Python to check if a string can become empty by recursive deletion
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Create a new string by alternately combining the characters of two halves of the string in reverse
- Given a string and an integer k, find the kth sub-string when all the sub-strings are sorted according to the given condition
- Check if a string can be converted to another string by replacing vowels and consonants
- Minimum deletions from string to reduce it to string with at most 2 unique characters
- Minimum number of given operations required to convert a string to another string
- Find the character in first string that is present at minimum index in second string
- Find length of longest subsequence of one string which is substring of another string
- Find the count of palindromic sub-string of a string in its sorted form
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.