Given an array of words and a string, we need to count all words that are present in given string.
Examples:
Input : words[] = { "welcome", "to", "geeks", "portal"}
str = "geeksforgeeks is a computer science portal for geeks."
Output : 2
Two words "portal" and "geeks" is present in str.
Input : words[] = {"Save", "Water", "Save", "Yourself"}
str = "Save"
Output :1
Steps:
- Extract each word from string.
- For each word, check if it is in word array(by creating set/map). If present, increment result.
Below is the Java implementation of above steps
// Java program to count number // of words present in a string import java.util.HashSet; import java.util.regex.Matcher; import java.util.regex.Pattern; public class Test { static int countOccurrence(String[] word, String str) { // counter int counter = 0; // for extracting words Pattern p = Pattern.compile("[a-zA-Z]+"); Matcher m = p.matcher(str); // HashSet for quick check whether // a word in str present in word[] or not HashSet<String> hs = new HashSet<String>(); for (String string : word) { hs.add(string); } while(m.find()) { if(hs.contains(m.group())) counter++; } return counter; } public static void main(String[] args) { String word[] = { "welcome", "to", "geeks", "portal"}; String str = "geeksforgeeks is a computer science portal for geeks."; System.out.println(countOccurrence(word,str)); } } |
Output:
2
This article is contributed by Rishabh Jain. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
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.
Recommended Posts:
- Check if the given string of words can be formed from words present in the dictionary
- Count of words that are present in all the given sentences
- Check if given words are present in a string
- Count words that appear exactly two times in an array of words
- Count of anagrams of each string in an array present in another array
- Remove characters from the first string which are present in the second string
- Find the character in first string that is present at minimum index in second string
- Most frequent word in first String which is not present in second String
- Find the longest sub-string which is prefix, suffix and also present inside the string
- Find the longest sub-string which is prefix, suffix and also present inside the string | Set 2
- Count words in a given string
- Calculate sum of all numbers present in a string
- Find repeated character present first in a string
- Python | Check if a Substring is Present in a Given String
- Program to print characters present at prime indexes in a given string
- Find the largest Alphabetic character present in the string
- Number of substrings of one string present in other
- Check whether the Average Character of the String is present or not
- First string from the given array whose reverse is also present in the same array
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
