Given two strings str1 and str2, the task is to count the number of times “str2” occurs in “str1” using recursion.
Input : str1 = "geeksforgeeks", str2 = "geek" Output : 2 Input: kanekihiishishi Output: 3
Suppose the problem has n parts, divide the problem in such a way that considers n-1 parts already done after which the operation to be performed is limited to only one part. Thereby, dividing the recursion approach into two cases i.e. base case and the recursive case.
In this particular problem, the base case involves the fact that if the length of str1 is less than that of str2.
Now, talking about the recursive case, compare first substring of str1 with str2 and recur for remaining str1.
- Decode a string recursively encoded as count followed by substring
- Lexicographically smallest substring with maximum occurrences containing a's and b's only
- Count of occurrences of a "1(0+)1" pattern in a string
- Count occurrences of a word in string
- Count occurrences of a character in a repeated string
- Longest substring with count of 1s more than 0s
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Count occurrences of a string that can be constructed from another given string
- Length of the largest substring which have character with frequency greater than or equal to half of the substring
- Find if a given string can be represented from a substring by iterating the substring “n” times
- Partition given string in such manner that i'th substring is sum of (i-1)'th and (i-2)'th substring
- Search in a trie Recursively
- Insertion in a Trie recursively
- Recursively remove all adjacent duplicates
- Find middle of singly linked list Recursively
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.