Initialize a variable result = 0.

Extract the last digit using num % 10.

Multiply result by 10 and add the last digit to it.

Remove the last digit from num using num // 10.

Repeat until the number becomes 0.

Compare the reversed number with the original number.

If they are equal, print the number as it is a palindrome.

Code

#include<iostream> using namespace std;  // A function to check if n is palindrome bool isPalindrome(int n) {     int reverse = 0;     int temp = n;          // Reverse the number by extracting its digits     while(temp > 0) {         reverse = reverse * 10 + temp % 10;         temp = temp / 10;     }      // If n and reverse are the same, then n is a palindrome     return (n == reverse); }  int main() {     int min = 100;     int max = 150;      // Loop through all numbers in the given range     for(int i = min; i <= max; i++) {         // Print the number if it's a palindrome         if(isPalindrome(i)) {             cout << i << " ";         }     }      return 0; } 