Accenture Coding Question 13

 #include<stdio.h>
int main()
{
int i, n, reverse, d,f,l;
printf("enter the starting \n",f);
scanf("%d",&f);
printf("enter the ending\n",l);
scanf("%d",&l);
for (i = f; i <= l; i++)
{
reverse = 0;
n = num;
while (n != 0)
{
d = n % 10;
reverse = reverse * 10 + d;
n = n / 10;
}
if (i == reverse)
printf("%d ",i);
}
return 0;
} 

#include<iostream>
using namespace std;
int reverse(int);
int main()
{
int i,f,l;
cout<<"enter the starting \n",f;
cin>>f;
cout<<"enter the ending\n",l;
cin>>l;
for (i = f; i <= l; i++)
{
if(i==reverse(i))
cout<<" "<<i;
}
return 0;
}
int reverse(int a)
{
int n=0,d=0,rev=0;
n = a;
while (n != 0)
{
d = n % 10;
rev = rev * 10 + d;
n = n / 10;
}
return rev;

}

import java.util.Scanner;
import java.util.ArrayList;
import java.util.Collections;


public class Main {

	static int pallindrome(int no1) {
		int rem=0;
		int div = no1;
		while (div != 0)
		{
		int r = div % 10;
		rem = (rem * 10) + r;
		div = div / 10;
		}
		return rem;
	}
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		System.out.println("Enter Upper and Lower Limit");
		int ul = sc.nextInt();
		int ll = sc.nextInt();
		for (int i = ul; i <= ll; i++) {
			if(i==pallindrome(i)) 
				System.out.println(i);
			}
	}
}

# Palindrome Number Checking

first_number = int(input())
second_number = int(input())

for i in range(first_number, second_number+1):
reverse = 0
temp = i
while temp != 0:
remainder = temp % 10
reverse = (reverse * 10)+remainder
temp = temp // 10
if i == reverse:
print(reverse, end=" ")