Problem:
Score : 200 points

Problem Statement

Find the number of palindromic numbers among the integers between A and B (inclusive).
Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

10000 \leq A \leq B \leq 99999

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;
import java.util.ArrayList;
import java.util.List;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String[] a = sc.nextLine().split(" ");
        int small = Integer.parseInt(a[0]);
        int large = Integer.parseInt(a[1]);
        int count = 0;
        //System.out.println(small +"."+ large);
        for(int i=small ; i <= large ; i++){
            int number = i;
            //System.out.println(number);
            List<Integer> n = new ArrayList<Integer>();
            for(int j=0; j<5 ; j++){
                int c =number % 10;
                n.add(c);
                number = number/10;
                //System.out.println(n.get(j));
            }
            if(n.get(0) == n.get(4) && n.get(1) == n.get(3)){
                count++;
                //System.out.println(n.get(0)+" "+ n.get(4)+" "+ n.get(1) +" "+n.get(3));
            }
        }
        System.out.println(count);
    }
}