I have been given a challenge to do witH Java and one of the questions I keep getting the wrong answer the question is: 

What is the sum of all of the palindromic numbers that are the products of two 2-digit or 1-digit numbers?

Edit:
So I basically need code that will work out the sum of all palindromes who can be made from 2 numbers either 2-digit or 1-digit.

```
package projects;

import java.util.ArrayList;

public class Project3 {

    public static void main(String[] args) {
        new Project3();
    }

    public Project3(){
        ArrayList<Integer> numbers = new ArrayList<Integer>();

        //generate 1-9
        for(int i = 1; i < 10; i++){
            numbers.add(i);
        }

        //generate 11-99
        for(int i = 10; i < 100; i+=10){
            numbers.add(i + (i / 10));
        }

        //generate 100-999
        for(int i = 100; i < 1000; i+=100){
            for(int j = 1; j < 10; j++){
                numbers.add(i + (j*10) + (i / 100));
            }
        }

        //generate 1000 - 9999
        for(int i = 1000; i < 10000; i+=1000){
            for(int j = 1; j < 10; j++){
                numbers.add(i + (j * 100) + (j * 10) + (i / 1000));
            }
        }

        boolean product = false;

        for(int i = 0; i < numbers.size(); i++){
            product = false;
            for(int j = 99; j >= 1; j--){
                if(numbers.get(i).intValue() % j == 0){
                    product = true;
                    break;
                }
            }
            if(product == false){
                numbers.remove(i);
            }
        }

        int total = 0;

        for(int i = 0; i < numbers.size(); i++){
            total += numbers.get(i);
            System.out.println(numbers.get(i) + "\t\t" + total);
        }

        System.out.println(total);
    }

    public String reverse(String thing){
        String reversed = "";
        char[] array = thing.toCharArray();
        for(int x = thing.length() - 1; x >= 0; x--){
            reversed += array[x];
        }
        return reversed;
    }

}

```

Edit:

I am trying to ask what/where my program is going wrong and what I could do to get a program that will give me th right answer.