The document describes a Java program that uses a stack to determine if a user-input string is a palindrome or not. The program prompts the user to enter a string, pushes the characters onto a stack, pops them off to build a reversed string, and compares the original to the reversed to check for palindromic equality.

1. import java.util.Stack; import java.util.Scanner; class PalindromeDemo { public static void
main(String[] args) { System.out.print("Enter any string:"); Scanner in=new
Scanner(System.in); String inputString = in.nextLine(); Stack stack = new Stack();
for (int i = 0; i < inputString.length(); i++) { stack.push(inputString.charAt(i)); }
String reverseString = ""; while (!stack.isEmpty()) { reverseString =
reverseString+stack.pop(); } if (inputString.equals(reverseString))
System.out.println("The input String is a palindrome."); else
System.out.println("The input String is not a palindrome."); } }
Solution
import java.util.Stack; import java.util.Scanner; class PalindromeDemo { public static void
main(String[] args) { System.out.print("Enter any string:"); Scanner in=new
Scanner(System.in); String inputString = in.nextLine(); Stack stack = new Stack();
for (int i = 0; i < inputString.length(); i++) { stack.push(inputString.charAt(i)); }
String reverseString = ""; while (!stack.isEmpty()) { reverseString =
reverseString+stack.pop(); } if (inputString.equals(reverseString))
System.out.println("The input String is a palindrome."); else
System.out.println("The input String is not a palindrome."); } }