Given two strings str1 and str2. The task is to find the minimum number of characters to be replaced by $ in string str1 such that str1 does not contain string str2 as any substring.
Input: str1 = "intellect", str2 = "tell" Output: 1 4th character of string "str1" can be replaced by $ such that "int$llect" it does not contain "tell" as a substring. Input: str1 = "google", str2 = "apple" Output: 0
Approach is similar to Searching for Patterns | Set 1 (Naive Pattern Searching).
The idea is to find the leftmost occurrence of the string ‘str2’ in the string ‘str1’. If all the characters of ‘str1’ match with ‘str2’, we will replace (or increment our answer with one) the last symbol of occurrence and increment the index of string ‘str1’, such that it checks again for the substring after the replaced character(that is index i will be equal to i+length(b)-1).
Below is the implementation of the above approach:
Time Complexity: O(len1 * len2), where len1 is the length of first string and len2 is the length of second string.
Also, this problem can be solved directly by using Python’s in-built function-string1.count(string2)
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 replaced to make frequency of all characters same
- Minimum number of 1's to be replaced in a binary array
- Longest substring with atmost K characters from the given set of characters
- Minimum cost to remove the spaces between characters of a String by rearranging the characters
- Modify the string such that every character gets replaced with the next character in the keyboard
- Minimum length of substring whose rotation generates a palindromic substring
- Minimum number of steps needed to remove the substring K from given string
- 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
- Minimum steps to remove substring 010 from a binary string
- Minimum length substring with exactly K distinct characters
- Minimum steps to delete a string by deleting substring comprising of same characters
- Remove minimum characters from string to split it into three substrings under given constraints
- Length of the largest substring which have character with frequency greater than or equal to half of the substring
- Find the longest substring with k unique characters in a given string
- Count of distinct characters in a substring by given range for Q queries
- Remove minimum number of characters so that two strings become anagram
- Minimum number of operations to move all uppercase characters before all lower case characters
- Minimum characters that are to be inserted such that no three consecutive characters are same
- Length of the longest substring without repeating characters
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.