Answer:
class Main {
public static String reverseString(String str) {
StringBuilder sb = new StringBuilder(str);
sb.reverse();
return sb.toString();
}
public static boolean isPalindrome(int n) {
String s = Integer.toString(n);
return (s.length() > 1 && s.equals(reverseString(s)));
}
public static void main(String[] args) {
int n = 10;
int found = 0;
while(found<100) {
if(isPalindrome(n)) {
found++;
System.out.printf("%d ",n);
if (found % 10 == 0) {
System.out.print("\\");
}
}
n++;
}
}
}
Step-by-step explanation:
To be a palindrome, I require a stringified version of the number to have at least length 2 and to be equal to its reverse.