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 two.Input : Welcome to GeeksforGeeks
Output : No Palindrome Word
Explanation:The string does not contain any palindrome word so the output is No Palindrome Word.
Approach:
- longestPalin() function finds the longest palindrome word 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 checks if the word is palindrome. It returns true if word is palindrome else returns false. 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 print longest palindrome word in a sentence and its length*/#include <iostream> #include <algorithm> #include <string> using namespace std; // Function to check if a // word is palindrome bool checkPalin(string word) { int n = word.length(); // making the check case // case insensitive // word = word.toLowerCase(); transform(word.begin(), word.end(), word.begin(), ::tolower); // loop to check palindrome for (int i = 0; i < n; i++, n--) if (word[i] != word[n - 1]) return false; return true; } // Function to find longest // palindrome word string longestPalin(string str) { // to check last word for palindrome str = str + " "; // to store each word string longestword = "", word = ""; int length, length1 = 0; for (int i = 0; i < str.length(); i++) { char ch = str[i]; // extracting each word if (ch != ' ') word = word + ch; else { length = word.length(); if (checkPalin(word) && length > length1) { length1 = length; longestword = word; } word = ""; } } return longestword; } // Driver code int main() { string s = "My name is ava and i love" " Geeksforgeeks"; if (longestPalin(s) == "") cout<<"No Palindrome"<<" Word"; else cout<<longestPalin(s); return 0; } // This code is contributed by Manish // Shaw (manishshaw1) |
chevron_right
filter_none
Java
/*Java program to print longest palindrome word in a sentence and its length*/ public class GFG { // Function to check if a // word is palindrome static boolean checkPalin(String word) { int n = word.length(); // making the check case // case insensitive word = word.toLowerCase(); // loop to check palindrome for (int i = 0; i < n; i++, n--) if (word.charAt(i) != word.charAt(n - 1)) return false; return true; } // Function to find longest // palindrome word static String longestPalin(String str) { // to check last word for palindrome str = str + " "; // to store each word String longestword = "", word = ""; int length, length1 = 0; for (int i = 0; i < str.length(); i++) { char ch = str.charAt(i); // extracting each word if (ch != ' ') word = word + ch; else { length = word.length(); if (checkPalin(word) && length > length1) { length1 = length; longestword = word; } word = ""; } } return longestword; } // Driver code public static void main(String args[]) { String s = new String("My name is ava " + "and i love Geeksforgeeks"); if (longestPalin(s) == "") System.out.println("No Palindrome" + " Word"); else System.out.println(longestPalin(s)); } } |
chevron_right
filter_none
Python3
# Python 3 program to print longest palindrome
# word in a sentence and its length
# Function to check if a word is palindrome
def checkPalin(word):
n = len(word)
# making the check case
# case insensitive
word = word.lower()
# loop to check palindrome
for i in range( n):
if (word[i] != word[n – 1]):
return False
n -= 1
return True
# Function to find longest
# palindrome word
def longestPalin(str):
# to check last word for palindrome
str = str + ” ”
# to store each word
longestword = “”
word = “”
length1 = 0
for i in range(len(str)):
ch = str[i]
# extracting each word
if (ch != ‘ ‘):
word = word + ch
else :
length = len(word)
if (checkPalin(word) and
length > length1):
length1 = length
longestword = word
word = “”
return longestword
# Driver code
if __name__ == “__main__”:
s = “My name is ava and i love Geeksforgeeks”
if (longestPalin(s) == “”):
print(“No Palindrome Word”)
else:
print(longestPalin(s))
# This code is contributed by ita_c
C#
/* C# program to print longest palindrome word in a sentence and its length*/using System; class GFG { // Function to check if a // word is palindrome static bool checkPalin(string word) { int n = word.Length; // making the check case // case insensitive word = word.ToLower(); // loop to check palindrome for (int i = 0; i < n; i++, n--) if (word[i] != word[n - 1]) return false; return true; } // Function to find longest // palindrome word static string longestPalin(string str) { // to check last word for palindrome str = str + " "; // to store each word string longestword = "", word = ""; int length, length1 = 0; for (int i = 0; i < str.Length; i++) { char ch = str[i]; // extracting each word if (ch != ' ') word = word + ch; else { length = word.Length; if (checkPalin(word) && length > length1) { length1 = length; longestword = word; } word = ""; } } return longestword; } // Driver code public static void Main() { string s = "My name is ava and i" + " love Geeksforgeeks"; if (longestPalin(s) == "") Console.Write("No Palindrome Word"); else Console.Write(longestPalin(s)); } } // This code is contributed by Manish // Shaw (manishshaw1) |
chevron_right
filter_none
Output:
ava
Recommended Posts:
- Program for length of the longest word in a sentence
- Print each word in a sentence with their corresponding average of ASCII values
- Sentence Palindrome (Palindrome after removing spaces, dots, .. etc)
- Longest Common Prefix using Word by Word Matching
- Program to replace a word with asterisks in a sentence
- Sums of ASCII values of each word in a sentence
- Java program to count the characters in each word in a given sentence
- Count palindrome words in a sentence
- Next word that does not contain a palindrome and has characters from first k
- Print given sentence into its equivalent ASCII form
- Longest Possible Chunked Palindrome
- Longest palindrome subsequence with O(n) space
- Longest double string from a Palindrome
- Length of the longest substring that do not contain any palindrome
- Find longest palindrome formed by removing or shuffling chars from 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 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.
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Minimum steps to delete a string by deleting substring comprising of same characters
- Check if two strings are same ignoring their cases
- Print the longest prefix of the given string which is also the suffix of the same string
- Maximize the happiness of the groups on the Trip
- Minimum number of operations to move all uppercase characters before all lower case characters
- Find the time which is palindromic and comes after the given time
- Minimum number of bracket reversals needed to make an expression balanced | Set - 2
- Find k-th character of decrypted string | Set - 2
- Find if it is possible to make a binary string which contanins given number of "0", "1" , "01" and "10" as sub sequences
