Given a string str, the task is to count all possible sub-strings of the given string that are prefix of the same string.
Input: str = “ababc”
All possible sub-string are “a”, “ab”, “aba”, “abab”, “ababc”, “a” and “ab”
Input: str = “abdabc”
Approach: Traverse the string character by character, if the current character is equal to the first character of the string then count all possible sub-strings starting from here that are also the prefixes of str and add it to count. After the complete string has been traversed, print the count.
Below is the implementation of the above approach:
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Python program to print the substrings that are prefix of the given string
- Find the longest sub-string which is prefix, suffix and also present inside the string | Set 2
- Longest palindromic string formed by concatenation of prefix and suffix of a string
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Print the longest prefix of the given string which is also the suffix of the same string
- Longest string in an array which matches with prefix of the given string
- Longest string which is prefix string of at least two strings
- Number of substrings of a string
- Replace two substrings (of a string) with each other
- Lexicographical concatenation of all substrings of a string
- Program to print all substrings of a given string
- Split the string into substrings using delimiter
- Count of substrings of a binary string containing K ones
- Number of substrings of one string present in other
- Sum of all substrings of a string representing a number | Set 1
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.