Given two string ‘S1’ and ‘S2’, the task is to return the most frequent (which is used the maximum number of times) word from ‘S1’ that is not present in ‘S2’. If more than one word is possible then print lexicographically smallest among them.
Input: S1 = “geeks for geeks is best place to learn”, S2 = “bad place”
“geeks” is the most frequent word in S1 and is also not present in S2.
Input: S1 = “the quick brown fox jumps over the lazy dog”, S2 = “the brown fox jumps”
- Iterate through string S2 and create a map and insert all of the words in it to the map.
- Iterate through string S1 and check whether the word is not present in the map created in the previous step or not.
- If the word satisfies the condition then update the answer if the frequency of the same word is maximum till now.
- If the frequency of the word is equal to the previously chosen word then update the answer according to lexicographically smallest of the two strings.
Below is the implementation of above approach:
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Find the character in first string that is present at minimum index in second string
- Remove characters from the first string which are present in the second string
- String containing first letter of every word in a given string with spaces
- Find the most frequent digit without using array/string
- Most frequent word in an array of strings
- Count words present in a string
- Number of substrings of one string present in other
- Calculate sum of all numbers present in a string
- Find repeated character present first in a string
- Check whether the Average Character of the String is present or not
- Python | Check if a Substring is Present in a Given String
- Length Of Last Word in a String
- Print last character of each word in a string
- Capitalize the first and last character of each word in a string
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.