Here is the optimized solution in Java. Copy or view it below.
Java
package Problems_On_Number;
public class PalindromeNumbersInRange {
static boolean isPalindrome(int n) {
int reverse = 0;
int temp = n;
while (temp > 0) {
reverse = reverse * 10 + temp % 10;
temp = temp / 10;
}
// If n and reverse are same,
// then n is palindrome
if (n == reverse)
return true;
return false;
}
public static void main(String args[]) {
int min = 100;
int max = 150;
for (int i = min; i <= max; i++) {
if (isPalindrome(i)) {
System.out.print(i + " ");
}
}
}
}