anonymous
  • anonymous
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
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
Which language?
anonymous
  • anonymous
Java. I can put in the code I have so far if it'd help.
anonymous
  • anonymous
yes please

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
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.");
anonymous
  • anonymous
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?
anonymous
  • anonymous
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)
rsmith6559
  • rsmith6559
Ignore the first letter, and check if the rest of the word is a palindrome.

Looking for something else?

Not the answer you are looking for? Search for more explanations.