Count occurrences of a word in string
Last Updated :
23 Apr, 2025
You are given a string and a word your task is that count the number of occurrences of the given word in the string and print the number of occurrences of the word.
Examples:
Input : string = "GeeksforGeeks A computer science portal for geeks"
word = "portal"
Output : Occurrences of Word = 1 Time
Input : string = "GeeksforGeeks A computer science portal for geeks"
word = "technical"
Output : Occurrences of Word = 0 Time
Approach:
- First, we split the string by spaces in a
- Then, take a variable count = 0 and in every true condition we increment the count by 1
- Now run a loop at 0 to length of string and check if our string is equal to the word
- if condition is true then we increment the value of count by 1 and in the end, we print the value of count.
Below is the implementation of the above approach :
C++
// C++ program to count the number
// of occurrence of a word in
// the given string
#include <bits/stdc++.h>
using namespace std;
int countOccurrences(char *str,
string word)
{
char *p;
// split the string by spaces in a
vector<string> a;
p = strtok(str, " ");
while (p != NULL)
{
a.push_back(p);
p = strtok(NULL, " ");
}
// search for pattern in a
int c = 0;
for (int i = 0; i < a.size(); i++)
// if match found increase count
if (word == a[i])
c++;
return c;
}
// Driver code
int main()
{
char str[] = "GeeksforGeeks A computer science portal for geeks ";
string word = "portal";
cout << countOccurrences(str, word);
return 0;
}
// This code is contributed by
// sanjeev2552
// C program to count the number
// of occurrence of a word in
// the given string
#include <stdio.h>
#include <string.h>
int countOccurrences(char *str, char *word)
{
char *p;
// split the string by spaces in a
char *a[300];
int index=0;
p = strtok(str, " ");
while (p != NULL)
{
a[index++]=(p);
p = strtok(NULL, " ");
}
// search for pattern in a
int c = 0;
for (int i = 0; i < index; i++)
// if match found increase count
if (strcmp(word , a[i])==0){
c++;
}
return c;
}
// Driver code
int main()
{
char str[] = "GeeksforGeeks A computer science portal for geeks ";
char word[] = "portal";
printf("%d",countOccurrences(str, word));
return 0;
}
// Java program to count the number
// of occurrence of a word in
// the given string
import java.io.*;
class GFG {
static int countOccurrences(String str, String word)
{
// split the string by spaces in a
String a[] = str.split(" ");
// search for pattern in a
int count = 0;
for (int i = 0; i < a.length; i++)
{
// if match found increase count
if (word.equals(a[i]))
count++;
}
return count;
}
// Driver code
public static void main(String args[])
{
String str = "GeeksforGeeks A computer science portal for geeks ";
String word = "portal";
System.out.println(countOccurrences(str, word));
}
}
/*This code is contributed by Nikita Tiwari.*/
# Python program to count the number of occurrence
# of a word in the given string
def countOccurrences(str, word):
# split the string by spaces in a
a = str.split(" ")
# search for pattern in a
count = 0
for i in range(0, len(a)):
# if match found increase count
if (word == a[i]):
count = count + 1
return count
# Driver code
str ="GeeksforGeeks A computer science portal for geeks "
word ="portal"
print(countOccurrences(str, word))
// C# program to count the number
// of occurrence of a word in
// the given string
using System;
class GFG
{
static int countOccurrences(string str,
string word)
{
// split the string by spaces
string[] a = str.Split(' ');
// search for pattern in string
int count = 0;
for (int i = 0; i < a.Length; i++)
{
// if match found increase count
if (word.Equals(a[i]))
count++;
}
return count;
}
// Driver code
public static void Main()
{
string str = "GeeksforGeeks A computer science portal for geeks ";
string word = "portal";
Console.Write(countOccurrences(str, word));
}
}
// This code is contributed
// by ChitraNayal
<script>
// Javascript program to count the number
// of occurrence of a word in
// the given string
function countOccurrences(str,word)
{
// split the string by spaces in a
let a = str.split(" ");
// search for pattern in a
let count = 0;
for (let i = 0; i < a.length; i++)
{
// if match found increase count
if (word==(a[i]))
count++;
}
return count;
}
// Driver code
let str = "GeeksforGeeks A computer
science portal for geeks ";
let word = "portal";
document.write(countOccurrences(str, word));
// This code is contributed by avanitrachhadiya2155
</script>
<?php
// PHP program to count the number
// of occurrence of a word in
// the given string
function countOccurrences($str, $word)
{
// split the string by spaces
$a = explode(" ", $str);
// search for pattern in string
$count = 0;
for ($i = 0; $i < sizeof($a); $i++)
{
// if match found increase count
if ($word == $a[$i])
$count++;
}
return $count;
}
// Driver code
$str = "GeeksforGeeks A computer science portal for geeks ";
$word = "portal";
echo (countOccurrences($str, $word));
// This code is contributed
// by ChitraNayal
?>
Time Complexity: O(n)
Auxiliary Space: O(n)
Method #2: Using Count() function in python:
- First, we split the string by spaces and store in list.
- We use count() to find count of that word in list.
Below is the implementation:
C++
// C++ program to count the number of occurrence
// of a word in the given string
#include <bits/stdc++.h>
using namespace std;
int countOccurrences(string str, string word)
{
// Split the string into words
stringstream ss(str);
string token;
vector<string> wordslist;
while (ss >> token) {
wordslist.push_back(token);
}
// Count the number of occurrences of the given word
int count = 0;
for (int i = 0; i < wordslist.size(); i++) {
if (wordslist[i] == word) {
count++;
}
}
return count;
}
// Driver code
int main()
{
string str = "GeeksforGeeks A computer science portal "
"for geeks";
string word = "portal";
cout << countOccurrences(str, word);
return 0;
}
import java.util.*;
public class Main
{
// Function to count the number of occurrences of a word
// in the given string
static int countOccurrences(String str, String word)
{
// Splitting the string into words
List<String> wordslist
= Arrays.asList(str.split("\\s+"));
// Counting the frequency of the given word
return Collections.frequency(wordslist, word);
}
public static void main(String[] args)
{
// Input string
String str
= "GeeksforGeeks A computer science portal for geeks ";
// Word to be counted
String word = "portal";
// Printing the count of occurrences of the given
// word in the input string
System.out.println(countOccurrences(str, word));
}
}
# Python program to count the number of occurrence
# of a word in the given string
def countOccurrences(str, word):
wordslist = list(str.split())
return wordslist.count(word)
# Driver code
str = "GeeksforGeeks A computer science portal for geeks "
word = "portal"
print(countOccurrences(str, word))
# This code is contributed by vikkycirus
using System;
using System.Collections.Generic;
public class GFG{
// Function to count the number of occurrences of a word
// in the given string
static int CountOccurrences(string str, string word){
// Splitting the string into words
List<string> wordsList = new List<string>(str.Split(new char[] { ' ' }, StringSplitOptions.RemoveEmptyEntries));
// Counting the frequency of the given word
return wordsList.FindAll(w => w == word).Count;
}
public static void Main(string[] args){
// Input string
string str = "GeeksforGeeks A computer science portal for geeks ";
// Word to be counted
string word = "portal";
// Printing the count of occurrences of the given
// word in the input string
Console.WriteLine(CountOccurrences(str, word));
}
}
// Javascript program to count the number of occurrence
// of a word in the given string
function countOccurrences(str, word) {
// Split the string into words
let wordslist = str.split(" ");
// Count the number of occurrences of the given word
let count = 0;
for (let i = 0; i < wordslist.length; i++) {
if (wordslist[i] === word) {
count++;
}
}
return count;
}
// Driver code to test above functions
let str = "GeeksforGeeks A computer science portal for geeks";
let word = "portal";
console.log(countOccurrences(str, word));
// THIS CODE IS CONTRIBUTED BY KANCHAN AGARWAL
Time Complexity: O(n)
Auxiliary Space: O(n)
Reference: split function python
METHOD 3:Using re.findall module in python.
APPROACH:
The above code uses the re module to find all non-overlapping occurrences of the given word in the given string, and returns the count of those occurrences.
ALGORITHM:
1.Use the re.findall() method to find all non-overlapping occurrences of the given word in the given string.
2.Return the length of the resulting list of occurrences.
C++
#include <iostream>
#include <string>
#include <regex>
using namespace std;
int count_word_occurrences2(const string& str, const string& word) {
// Use regular expression to find all occurrences of the word in the string
regex regex_word(word);
sregex_iterator it(str.begin(), str.end(), regex_word);
sregex_iterator end;
// Calculate the count of occurrences
int count = 0;
while (it != end) {
count++;
++it;
}
return count;
}
int main() {
string str = "GeeksforGeeks A computer science portal for geeks";
string word = "portal";
int count = count_word_occurrences2(str, word);
cout << "Occurrences of Word = " << count << " Time" << endl;
return 0;
}
import java.util.regex.*;
public class WordOccurrences {
public static int countWordOccurrences(String str, String word) {
// Use regular expression to find all occurrences of the word in the string
Pattern pattern = Pattern.compile("\\b" + Pattern.quote(word) + "\\b");
Matcher matcher = pattern.matcher(str);
// Calculate the count of occurrences
int count = 0;
while (matcher.find()) {
count++;
}
return count;
}
public static void main(String[] args) {
String str = "GeeksforGeeks A computer science portal for geeks";
String word = "portal";
int count = countWordOccurrences(str, word);
System.out.println("Occurrences of Word = " + count + " Time");
}
}
import re
def count_word_occurrences2(string, word):
return len(re.findall(word, string))
# Example usage:
string = "GeeksforGeeks A computer science portal for geeks"
word = "portal"
count = count_word_occurrences2(string, word)
print(f"Occurrences of Word = {count} Time") # Output: Occurrences of Word = 1 Time
using System;
using System.Text.RegularExpressions;
class Program
{
static int CountWordOccurrences(string input, string word)
{
// Use regular expression to find all occurrences of the word in the input string
Regex regex = new Regex(word);
MatchCollection matches = regex.Matches(input);
// Calculate the count of occurrences
int count = matches.Count;
return count;
}
static void Main(string[] args)
{
string input = "GeeksforGeeks A computer science portal for geeks";
string word = "portal";
int count = CountWordOccurrences(input, word);
Console.WriteLine("Occurrences of Word = " + count + " Time");
}
}
// Function to count occurrences of a word in a string
function count_word_occurrences2(string, word) {
// Use regular expression to find all occurrences of the word in the string
const regex = new RegExp(word, 'g');
const matches = string.match(regex);
// Return the count of occurrences
return matches ? matches.length : 0;
}
// Example usage:
const string = "GeeksforGeeks A computer science portal for geeks";
const word = "portal";
const count = count_word_occurrences2(string, word);
console.log(`Occurrences of Word = ${count} Time`); // Output: Occurrences of Word = 1 Time
OutputOccurrences of Word = 1 Time
Time complexity: O(n),where n is the length of the string.
Space complexity: O(m), where m is the number of occurrences of the word in the string.
Similar Reads
Count words present in a string
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 : word
6 min read
Count Occurrences of a Given Character in a String
Given a string S and a character 'c', the task is to count the occurrence of the given character in the string. Examples: Input : S = "geeksforgeeks" and c = 'e'Output : 4Explanation: 'e' appears four times in str. Input : S = "abccdefgaa" and c = 'a' Output : 3Explanation: 'a' appears three times i
6 min read
Count words in a given string
Given a string, count the number of words in it. The words are separated by the following characters: space (' ') or new line ('\n') or tab ('\t') or a combination of these. Recommended PracticeCount number of wordsTry It!Method 1: The idea is to maintain two states: IN and OUT. The state OUT indica
15+ min read
Count occurrences of strings formed using words in another string
Given a string A and a vector of strings B, the task is to count the number of strings in vector B that only contains the words from A. Examples: Input: A="blue green red yellow"B[]={"blue red", "green pink", "yellow green"}Output: 2 Input: A="apple banana pear"B[]={"apple", "banana apple", "pear ba
7 min read
Count of occurrences of a "1(0+)1" pattern in a string
Given an alphanumeric string, find the number of times a pattern 1(0+)1 occurs in the given string. Here, (0+) signifies the presence of non empty sequence of consecutive 0's. Examples: Input : 1001010001 Output : 3 First sequence is in between 0th and 3rd index. Second sequence is in between 3rd an
7 min read
Count occurrences of a character in a repeated string
Given an integer N and a lowercase string. The string is repeated infinitely. The task is to find the No. of occurrences of a given character x in first N letters.Examples: Input : N = 10 str = "abcac"Output : 4Explanation: "abcacabcac" is the substring from the infinitely repeated string. In first
8 min read
Count occurrences of a word in string | Set 2 (Using Regular Expressions)
Given a string str and a word w, the task is to print the number of the occurrence of the given word in the string str using Regular Expression. Examples: Input: str = "peter parker picked a peck of pickled peppersâ€, w = "peck"Output: 1Explanation: There is only one occurrence of the word "peck" in
4 min read
Count Occurrences of Anagrams
Given a word pattern and a string text consisting of lowercase characters, the task is to return the count of substrings in text which are anagrams of the pattern. Examples: Input : text = "forxxorfxdofr", pattern = "for"Output : 3Explanation : Anagrams present are for, orf and ofr. Each appears in
10 min read
Counting the number of words in a Trie
A Trie is used to store dictionary words so that they can be searched efficiently and prefix search can be done. The task is to write a function to count the number of words. Example : Input : root / \ \ t a b | | | h n y | | \ | e s y e / | | i r w | | | r e e | r Output : 8 Explanation : Words for
7 min read
Create Word Counter app using Django
In this article, we are going to make a simple tool that counts a number of words in text using Django. Before diving into this topic you need to have some basic knowledge of Django. Refer to the below article to know about basics of Django. Django BasicsHow to Create a Basic Project using MVT in Dj
3 min read