Check if a word is present in a sentence

Given a sentence as a string str and a word word, the task is to check if the word is present in str or not. A sentence is a string comprised of multiple words and each word is separated with spaces.

Examples:

Input: str = “Geeks for Geeks”, word = “Geeks”
Output: Word is present in the sentence

Input: str = “Geeks for Geeks”, word = “eeks”
Output: Word is not present in the sentence

Approach: In this algorithm, stringstream is used to break the sentence into words then compare each individual word of the sentence with the given word. If the word is found then the function returns true.
Note that this implementation does not search for a sub-sequence or sub-string, it only searches for a complete single word in a sentence.



Below is the implementation for the case-sensitive search approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
  
// Function that returns true if the word is found
bool isWordPresent(string sentence, string word)
{
    // To break the sentence in words
    stringstream s(sentence);
  
    // To temporarily store each individual word
    string temp;
  
    while (s >> temp) {
  
        // Comparing the current word
        // with the word to be searched
        if (temp.compare(word) == 0) {
            return true;
        }
    }
    return false;
}
  
// Driver code
int main()
{
    string s = "Geeks for Geeks";
    string word = "Geeks";
  
    if (isWordPresent(s, word))
        cout << "Yes";
    else
        cout << "No";
  
    return 0;
}
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of the approach
class GFG
{
  
// Function that returns true if the word is found
static boolean isWordPresent(String sentence, String word)
{
    // To break the sentence in words
    String []s = sentence.split(" ");
  
    // To temporarily store each individual word 
    for ( String temp :s)
    {
  
        // Comparing the current word
        // with the word to be searched
        if (temp.compareTo(word) == 0)
        {
            return true;
        }
    }
    return false;
}
  
// Driver code
public static void main(String[] args)
{
    String s = "Geeks for Geeks";
    String word = "Geeks";
  
    if (isWordPresent(s, word))
        System.out.print("Yes");
    else
        System.out.print("No");
  
}
}
  
// This code is contributed by PrinciRaj1992
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation of the approach
  
# Function that returns true if the word is found
def isWordPresent(sentence, word):
      
    # To break the sentence in words
    s = sentence.split(" ")
  
    for i in s:
  
        # Comparing the current word
        # with the word to be searched
        if (i == word):
            return True
    return False
  
# Driver code
s = "Geeks for Geeks"
word = "Geeks"
  
if (isWordPresent(s, word)):
    print("Yes")
else:
    print("No")
  
# This code is contributed by mohit kumar 29
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# implementation of the approach
using System;
  
class GFG
{
  
// Function that returns true if the word is found
static bool isWordPresent(String sentence, String word)
{
    // To break the sentence in words
    String []s = sentence.Split(' ');
  
    // To temporarily store each individual word 
    foreach(String temp in s)
    {
  
        // Comparing the current word
        // with the word to be searched
        if (temp.CompareTo(word) == 0)
        {
            return true;
        }
    }
    return false;
}
  
// Driver code
public static void Main(String[] args)
{
    String s = "Geeks for Geeks";
    String word = "Geeks";
  
    if (isWordPresent(s, word))
        Console.Write("Yes");
    else
        Console.Write("No");
}
}
  
// This code is contributed by 29AjayKumar
chevron_right

Output:
Yes

Below is the implementation for the case-insensitive search approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
  
// Function that returns true if the word is found
bool isWordPresent(string sentence, string word)
{
    // To convert the word in uppercase
    transform(word.begin(),
              word.end(), word.begin(), ::toupper);
  
    // To convert the complete sentence in uppercase
    transform(sentence.begin(), sentence.end(),
              sentence.begin(), ::toupper);
  
    // Both strings are converted to the same case,
    // so that the search is not case-sensitive
  
    // To break the sentence in words
    stringstream s(sentence);
  
    // To store the individual words of the sentence
    string temp;
  
    while (s >> temp) {
  
        // Compare the current word
        // with the word to be searched
        if (temp.compare(word) == 0) {
            return true;
        }
    }
    return false;
}
  
// Driver code
int main()
{
    string s = "Geeks for Geeks";
    string word = "geeks";
  
    if (isWordPresent(s, word))
        cout << "Yes";
    else
        cout << "No";
  
    return 0;
}
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of the approach
import java.util.*;
  
class GFG
{
  
// Function that returns true if the word is found
static boolean isWordPresent(String sentence,
                            String word)
{
    // To convert the word in uppercase
    word = transform(word);
  
    // To convert the complete sentence in uppercase
    sentence = transform(sentence);
  
    // Both Strings are converted to the same case,
    // so that the search is not case-sensitive
  
    // To break the sentence in words
    String []s = sentence.split(" ");
  
    // To store the individual words of the sentence
    for ( String temp :s)
    {
  
        // Comparing the current word
        // with the word to be searched
        if (temp.compareTo(word) == 0)
        {
            return true;
        }
    }
    return false;
}
  
static String transform(String word) 
    return word.toUpperCase();
}
  
// Driver code
public static void main(String[] args)
{
    String s = "Geeks for Geeks";
    String word = "geeks";
  
    if (isWordPresent(s, word))
        System.out.print("Yes");
    else
        System.out.print("No");
}
}
  
// This code is contributed by PrinciRaj1992
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation of the approach 
  
# Function that returns true if the word is found 
def isWordPresent(sentence, word) :
      
    # To convert the word in uppercase 
    word = word.upper()
  
    # To convert the complete sentence in uppercase 
    sentence = sentence.upper()
  
    # Both strings are converted to the same case, 
    # so that the search is not case-sensitive 
  
    # To break the sentence in words 
    s = sentence.split(); 
  
    for temp in s :
  
        # Compare the current word 
        # with the word to be searched 
        if (temp == word) :
            return True
  
    return False
  
# Driver code 
if __name__ == "__main__"
  
    s = "Geeks for Geeks"
    word = "geeks"
  
    if (isWordPresent(s, word)) :
        print("Yes"); 
    else :
        print("No"); 
  
# This code is contributed by AnkitRai01
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# implementation of the approach
using System;
  
class GFG
{
  
// Function that returns true if the word is found
static bool isWordPresent(String sentence,
                            String word)
{
    // To convert the word in uppercase
    word = transform(word);
  
    // To convert the complete sentence in uppercase
    sentence = transform(sentence);
  
    // Both Strings are converted to the same case,
    // so that the search is not case-sensitive
  
    // To break the sentence in words
    String []s = sentence.Split(' ');
  
    // To store the individual words of the sentence
    foreach ( String temp in s)
    {
  
        // Comparing the current word
        // with the word to be searched
        if (temp.CompareTo(word) == 0)
        {
            return true;
        }
    }
    return false;
}
  
static String transform(String word) 
    return word.ToUpper();
}
  
// Driver code
public static void Main(String[] args)
{
    String s = "Geeks for Geeks";
    String word = "geeks";
  
    if (isWordPresent(s, word))
        Console.Write("Yes");
    else
        Console.Write("No");
}
}
  
// This code is contributed by 29AjayKumar
chevron_right

Output:
Yes

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 out this Author's contributed articles.

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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Article Tags :
Practice Tags :