Given two strings str and patt, the task is to find the count of times patt can be formed using the characters of str.
Input: str = “geeksforgeeks”, patt = “geeks”
“geeks” can be made at most twice from
the characters of “geeksforgeeks”.
Input: str = “abcbca”, patt = “aabc”
Approach: Count the frequency of all the characters of str and patt and store them in arrays strFreq and pattFreq respectively. Now any character ch which appears in patt can be used in a maximum of strFreq[ch] / pattFreq[ch] words and the minimum of this value among all the characters of patt is the required answer.
Below is the implementation of the above approach:
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.
- Check whether second string can be formed from characters of first string
- Sum of all numbers formed having 4 atmost X times, 5 atmost Y times and 6 atmost Z times
- Remove characters from the first string which are present in the second string
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Count of Substrings that can be formed without using the given list of Characters
- Check if a given string can be formed using characters of adjacent cells of a Matrix
- Count subsequences in first string which are anagrams of the second string
- Strings formed from given characters without any consecutive repeating characters
- Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first
- K length words that can be formed from given characters without repetition
- Number of ways in which the substring in range [L, R] can be formed using characters out of the range
- Count of strings in the first array which are smaller than every string in the second array
- Find the character in first string that is present at minimum index in second string
- Minimum changes required to make first string substring of second string
- Most frequent word in first String which is not present in second String
- Count elements present in first array but not in second
- Count number of rotated strings which have more number of vowels in the first half than second half
- Count distinct elements after adding each element of First Array with Second Array
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.