Question

So how would I be able to check if a String spelled with the first letter moved to the last (like banana -> ananab) is the same as the original word just spelled backwards?

Answer 1

Which language?

Answer 2

Java. I can put in the code I have so far if it'd help.

Answer 3

yes please

Answer 4

do
{
for (length = word.length() - 1; length >= 0; length--)
{
oppWord = oppWord + word.charAt(length);



}
if ()


oppWord = "";
System.out.println("Please enter the next word: ");
word = keyboard.next();
}
while (!word.equals("quit"));
System.out.println("All done.");

Answer 5

Write a function to reverse the word, and another to make a string by moving first letter to last; let me call them Reverse() and MoveFirst();
now it must be simpler to write the body of the do while loop.
Can you take it from here?

Answer 6

in c copy each character to stack and compare each character of string with the elemented popped from stack for starting and ending character write corresponding logic (easy)

Answer 7

Ignore the first letter, and check if the rest of the word is a palindrome.