0
Add your answer:
Earn +20 pts
What is string palindrome?
A string palindrome is some words that put together form a sentence. An example is "A man, a plan, a canal - Panama".
Can 1111 be a palindrome?
If you mean the number 1,111 or simply 1111, this is a palindrome. A palindrome is a string or number that is spelled or written the same way forward and backward.
What is the palindrome of 14?
There is no palindrome for 14.
Was it a rat palindrome?
"Was it a rat I saw? is a palindrome.
Is 1331 a palindrome?
Yes, 1331 is a palindrome
How do you determine if a given string is palindrome or not?
Reverse the string and compare it to the original. If they match, then it is a palindrome.
What are examples of a palindrome program forward and backwards?
To check if a string is a palindrome, point to each end of the string and work inwards towards the middle. If the characters pointed at differ, the string is not a palindrome. When the pointers meet or cross each other, the string is a palindrome. Note that the string cannot contain whitespace or punctuation and comparisons must not be case-sensitive.
What is string palindrome?
A string palindrome is some words that put together form a sentence. An example is "A man, a plan, a canal - Panama".
Program to check that given string is palindrome or not in C?
/*To check whether a string is palindrome*/includeincludevoid main () { int i,j,f=0; char a[10]; clrscr (); gets(a); for (i=0;a[i]!='\0';i++) { } i--; for (j=0;a[j]!='\0';j++,i--) { if (a[i]!=a[j]) f=1; } if (f==0) printf("string is palindrome"); else printf("string is not palindrome"); getch (); }
Program for palindrome in php?
You could use a function like this:function isPalindrome($string) {$string = strtolower($string);return (strrev($string) == $string) ? true : false;}and then to check a palindrome call an if statement like so:if(isPalindrome($test)) {echo $test.' is a palindrome';}else {echo $test.' is not a palindrome';}
Bluej program-read a string and check if the given string is a palindrome?
import java.util.Scanner; public class Palindrome{ public static void main(String[] args){ String front; String back =""; char[] failure; String backwards; Scanner input=new Scanner(System.in); System.out.print("Enter a word: "); front=input.next(); front=front.replaceAll(" ", ""); failure=front.toCharArray(); for (int i=0; i<failure.length; i++){ back=failure[i] + back; } if (front.equals(back)){ System.out.print("That word is a palindrome"); }else System.out.print("That word is not a palindrome"); }}
Can 1111 be a palindrome?
If you mean the number 1,111 or simply 1111, this is a palindrome. A palindrome is a string or number that is spelled or written the same way forward and backward.
How can a stack determine if a string is a palindrome?
foreach char in string push on to stack create new string foreach char in string pop off and add to end of new string if new string equals old string palindrome else not palindrome //when you pop off the stack, the characters come off in reverse order, thus you have reversed the original string
What is pallendrome in java?
palindrome in every language means same. it means on reversing a number or string, if we get the same number or string as the case may be ,then the number or string is called palindrome. eg: 1221,111,252 or LIRIL,MADAM etc .
What is the largest palindrome number?
It is a string of nines that goes on forever.
Write a PHP program to check whether the string is palindrome or not?
You can do this: <?php if ( $word === strrev( $word ) ) { echo "The word is a palindrome"; } else { echo "The word is not a palindrome"; }
Largest palindrome substring of a string?
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Vector; /** * */ /** * @author omnipath * */ public class Palindrome { /** * @param args */ public static void main(String[] args) { // open up standard input BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String string = null; // readLine() method try { string = br.readLine(); } catch (IOException ioe) { System.out.println("IO error trying to read input!"); System.exit(1); } Palindrome palindromeCase = new Palindrome(string); System.out.println("The longest palindrome is: " + palindromeCase.palindrome); System.out.println("The length of the longest palindrome is: " + palindromeCase.palindrome.length()); System.out.println("Counter is: " + palindromeCase.PalindromeCounter); } String originalString; String palindrome; Vector vectPalindromes; int palindromeLength; int PalindromeCounter; public Palindrome(String s) { PalindromeCounter = 0; this.palindrome = ""; this.palindromeLength = this.palindrome.length(); this.originalString = s; this.calculateLongestPalindrome(s); } public void calculateLongestPalindrome(String s) { if (s.length() == 1) { this.palindrome = this.originalString; this.palindromeLength = this.palindrome.length(); } this.parseForPalindrome(this.originalString); } public void parseForPalindrome(String s) { PalindromeCounter++; if (s.length() -1; i--) { sb.append(s.charAt(i)); } return sb.toString(); } }
