Count palindrome words in a sentence Last Updated : 22 Nov, 2022 Comments Improve Suggest changes Like Article Like Report Given a string str and the task is to count palindrome words present in the string str. Examples: Input : Madam Arora teaches malayalam Output : 3 The string contains three palindrome words (i.e., Madam, Arora, malayalam) so the count is three. Input : Nitin speaks malayalam Output : 2 The string contains two palindrome words (i.e., Nitin, malayalam) so the count is two. Method 1:countPalin() function counts the number of palindrome words by extracting every word of the string and passing it to checkPalin() function. An extra space is added in the original string to extract last word. checkPalin() function check the word palindrome. It returns 1 if word is palindrome else returns 0. It makes sure that empty strings are not counted as palindrome as the user may enter more than one spaces in between or at the beginning of the string. C++ /*C++ program to count number of palindrome words in a sentence*/ #include <bits/stdc++.h> using namespace std; // Function to check if a word is // palindrome bool checkPalin(string word) { int n = word.length(); transform(word.begin(), word.end(), word.begin(), ::tolower); for (int i = 0; i < n; i++,n--) if (word.at(i) != word.at(n - 1)) return false; return true; } // Function to count palindrome words int countPalin(string str) { // to check last word for palindrome str = str + " "; // to store each word string word = ""; int count = 0; for (int i = 0; i < str.length(); i++) { char ch = str.at(i); // extracting each word if (ch != ' ') word = word + ch; else { if (checkPalin(word)) count++; word = ""; } } return count; } // Driver code int main() { cout<<countPalin("Madam Arora teaches malayalam")<<endl; cout<<countPalin("Nitin speaks malayalam")<<endl; } // This code is contributed by nidhi16bcs2007 Java /*Java program to count number of palindrome words in a sentence*/ class GFG { // Function to check if a word is // palindrome static boolean checkPalin(String word) { int n = word.length(); word = word.toLowerCase(); for (int i=0; i<n; i++,n--) if (word.charAt(i) != word.charAt(n - 1)) return false; return true; } // Function to count palindrome words static int countPalin(String str) { // to check last word for palindrome str = str + " "; // to store each word String word = ""; int count = 0; for (int i = 0; i < str.length(); i++) { char ch = str.charAt(i); // extracting each word if (ch != ' ') word = word + ch; else { if (checkPalin(word)) count++; word = ""; } } return count; } // Driver code public static void main(String args[]) { System.out.println(countPalin("Madam " + "Arora teaches malayalam")); System.out.println(countPalin("Nitin " + "speaks malayalam")); } } Python3 # Python3 program to count number of # palindrome words in a sentence # Function to check if a word is palindrome def checkPalin(word): if word.lower() == word.lower()[::-1]: return True # Function to count palindrome words def countPalin(str): count = 0 # splitting each word as spaces as # delimiter and storing it into a list listOfWords = str.split(" ") # Iterating every element from list # and checking if it is a palindrome. for elements in listOfWords: if (checkPalin(elements)): # if the word is a palindrome # increment the count. count += 1 print (count) # Driver code countPalin("Madam Arora teaches malayalam") countPalin("Nitin speaks malayalam") # This code is contributed # by Ronit Shrivastava. C# // C# program to count number of // palindrome words in a sentence using System; class GFG { // Function to check if a word is // palindrome public static bool checkPalin(string word) { int n = word.Length; word = word.ToLower(); for (int i = 0; i < n; i++,n--) { if (word[i] != word[n - 1]) { return false; } } return true; } // Function to count palindrome words public static int countPalin(string str) { // to check last word for palindrome str = str + " "; // to store each word string word = ""; int count = 0; for (int i = 0; i < str.Length; i++) { char ch = str[i]; // extracting each word if (ch != ' ') { word = word + ch; } else { if (checkPalin(word)) { count++; } word = ""; } } return count; } // Driver code public static void Main(string[] args) { Console.WriteLine(countPalin("Madam " + "Arora teaches malayalam")); Console.WriteLine(countPalin("Nitin " + "speaks malayalam")); } } // This code is contributed by Shrikant13 JavaScript <script> /*Javascript program to count number of palindrome words in a sentence*/ // Function to check if a word is // palindrome function checkPalin(word) { var n = word.length word = word.toLowerCase(); for (var i = 0; i < n; i++,n--) if (word[i] != word[n - 1]) return false; return true; } // Function to count palindrome words function countPalin( str) { // to check last word for palindrome str = str + " "; // to store each word var word = ""; var count = 0; for (var i = 0; i < str.length; i++) { var ch = str[i]; // extracting each word if (ch != ' ') word = word + ch; else { if (checkPalin(word)) count++; word = ""; } } return count; } // Driver code document.write( countPalin("Madam Arora teaches malayalam") + "<br>"); document.write( countPalin("Nitin speaks malayalam")); // This code is contributed by itsok. </script> Output: 3 2 Time Complexity: O(n2), where n is the size of the given string.Auxiliary Space: O(n), where n is the size of the given string. -5HChTA0ME Comment More infoAdvertise with us Next Article Lexicographically first palindromic string A AnmolAgarwal Follow Improve Article Tags : Misc Strings DSA palindrome Practice Tags : MiscpalindromeStrings Similar Reads Palindrome String Coding Problems A string is called a palindrome if the reverse of the string is the same as the original one.Example: “madamâ€, “racecarâ€, “12321â€.Palindrome StringProperties of a Palindrome String:A palindrome string has some properties which are mentioned below:A palindrome string has a symmetric structure which m 2 min read Palindrome String Given a string s, the task is to check if it is palindrome or not.Example:Input: s = "abba"Output: 1Explanation: s is a palindromeInput: s = "abc" Output: 0Explanation: s is not a palindromeUsing Two-Pointers - O(n) time and O(1) spaceThe idea is to keep two pointers, one at the beginning (left) and 13 min read Check Palindrome by Different LanguageProgram to Check Palindrome Number in CPalindrome numbers are those numbers that remain the same even after reversing the order of their digits. In this article, we will learn how to check whether the given number is a palindrome number using C program.ExamplesInput: 121Output: YesExplanation: The number 121 remains the same when its dig 3 min read C Program to Check for Palindrome StringA string is said to be palindrome if the reverse of the string is the same as the string. In this article, we will learn how to check whether the given string is palindrome or not using C program.The simplest method to check for palindrome string is to reverse the given string and store it in a temp 4 min read C++ Program to Check if a Given String is Palindrome or NotA string is said to be palindrome if the reverse of the string is the same as the original string. In this article, we will check whether the given string is palindrome or not in C++.ExamplesInput: str = "ABCDCBA"Output: "ABCDCBA" is palindromeExplanation: Reverse of the string str is "ABCDCBA". So, 4 min read Java Program to Check Whether a String is a PalindromeA string in Java can be called a palindrome if we read it from forward or backward, it appears the same or in other words, we can say if we reverse a string and it is identical to the original string for example we have a string s = "jahaj " and when we reverse it s = "jahaj"(reversed) so they look 8 min read Easy Problems on PalindromeSentence Palindrome Given a sentence s, the task is to check if it is a palindrome sentence or not. A palindrome sentence is a sequence of characters, such as a word, phrase, or series of symbols, that reads the same backward as forward after converting all uppercase letters to lowercase and removing all non-alphanumer 9 min read Check if actual binary representation of a number is palindrome Given a non-negative integer n. The problem is to check if binary representation of n is palindrome or not. Note that the actual binary representation of the number is being considered for palindrome checking, no leading 0’s are being considered. Examples : Input : 9 Output : Yes (9)10 = (1001)2 Inp 6 min read Print longest palindrome word in a sentence Given a string str, the task is to print longest palindrome word present in the string str.Examples: Input : Madam Arora teaches Malayalam Output: Malayalam Explanation: The string contains three palindrome words (i.e., Madam, Arora, Malayalam) but the length of Malayalam is greater than the other t 14 min read Count palindrome words in a sentence Given a string str and the task is to count palindrome words present in the string str. Examples: Input : Madam Arora teaches malayalam Output : 3 The string contains three palindrome words (i.e., Madam, Arora, malayalam) so the count is three. Input : Nitin speaks malayalam Output : 2 The string co 5 min read Check if characters of a given string can be rearranged to form a palindrome Given a string, Check if the characters of the given string can be rearranged to form a palindrome. For example characters of "geeksogeeks" can be rearranged to form a palindrome "geeksoskeeg", but characters of "geeksforgeeks" cannot be rearranged to form a palindrome. Recommended PracticeAnagram P 14 min read Lexicographically first palindromic string Rearrange the characters of the given string to form a lexicographically first palindromic string. If no such string exists display message "no palindromic string". Examples: Input : malayalam Output : aalmymlaa Input : apple Output : no palindromic string Simple Approach: 1. Sort the string charact 13 min read Like