Write a program to detect if a String is a palidrome
Anonymous
Keep an index of the first and last characters in the string. Compare the characters at these indices, then shift the indices (increase the first index by 1, decrease the second index by 2). From StackOverflow: public static boolean istPalindrom(char[] word){ int i1 = 0; int i2 = word.length - 1; while (i2 > i1) { if (word[i1] != word[i2]) { return false; } ++i1; --i2; } return true; } If the interviewer requests that the function take a string then just use String.toCharArray
Check out your Company Bowl for anonymous work chats.