import [Link].
Scanner;
public class palindromicWords {
public static boolean isPalindrome(String word) {
String cleanedWord = [Link]("[^a-zA-Z]", "").toLowerCase();
int length = [Link]();
for (int i = 0; i < length / 2; i++) {
if ([Link](i) != [Link](length - 1 - i)) {
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner scanner = new Scanner([Link]);
[Link]("Enter a sentence:");
String sentence = [Link]();
int palindromicWordCount = 0;
String[] palindromicWords=new String[20];
int palCount=0;
String tmp="";
for(int i=0;i<[Link]();i++)
{
if([Link](i)!=' '){tmp+=[Link](i); }
if(([Link](i)==' ' || i==[Link]()-1) &&
isPalindrome(tmp))
{
palindromicWords[palCount++]=tmp;
tmp="";
palindromicWordCount++;
}
if([Link](i)==' ')tmp="";
}
if(palCount > 0)
{
[Link]("\nPalindromic words found:");
for (int j=0;j<palCount;j++) {
[Link](palindromicWords[j]);
}
}
[Link]("\nTotal number of palindromic words: " +
palindromicWordCount);
}
}