Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

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?

Computer Science
I got my questions answered at in under 10 minutes. Go to now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Join Brainly to access

this expert answer


To see the expert answer you'll need to create a free account at Brainly

Which language?
Java. I can put in the code I have so far if it'd help.
yes please

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

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 =; } while (!word.equals("quit")); System.out.println("All done.");
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?
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)
Ignore the first letter, and check if the rest of the word is a palindrome.

Not the answer you are looking for?

Search for more explanations.

Ask your own question