@@ -0,0 +1,1432 @@
+import java.util.ArrayList;%0Aimport java.util.Arrays;%0A%0A//Project Euler Problem 32%0A//Solved on 1/3/2016%0Apublic class Problem032%0A%7B%0A%09public static void main(String%5B%5D args)%0A%09%7B%0A%09%09int sum = 0;%09%09//total sum of valid products%0A%09%09char%5B%5D pandigital = %22123456789%22.toCharArray();%09%09//array of pandigital sequence used for comparison%0A%09%09ArrayList%3CInteger%3E solutions = new ArrayList%3CInteger%3E();%09%09//holds product solutions%0A%09%09for(int a = 2; a %3C= 98765; a++)%09%09//loop through multiplicands%0A%09%09%7B%0A%09%09%09for(int b = 123; a * b %3C= 98765; b++)%09%09//loop through multipliers%0A%09%09%09%7B%0A%09%09%09%09int c = a * b;%09%09//assign product%0A%09%09%09%09char%5B%5D combination = (Integer.toString(a) + Integer.toString(b) + Integer.toString(c)).toCharArray();%09//char array of fact family%0A%09%09%09%09Arrays.sort(combination);%09%09//sort the array%0A%09%09%09%09if(Arrays.equals(combination, pandigital))%09%09//compare contents of pandigital array and fact family array%0A%09%09%09%09%7B%0A%09%09%09%09%09if(solutions.size() != 0)%09%09//if solution's size isn't zero...%0A%09%09%09%09%09%7B%0A%09%09%09%09%09%09boolean matching = false;%09%09//check if solution already exists%0A%09%09%09%09%09%09for(int i = 0; i %3C solutions.size(); i++)%0A%09%09%09%09%09%09%7B%0A%09%09%09%09%09%09%09if(solutions.get(i) == c)%0A%09%09%09%09%09%09%09%7B%0A%09%09%09%09%09%09%09%09matching = true;%0A%09%09%09%09%09%09%09%7D%0A%09%09%09%09%09%09%7D%0A%09%09%09%09%09%09if(!matching)%09%09//add product to array list and sum%0A%09%09%09%09%09%09%7B%0A%09%09%09%09%09%09%09solutions.add(c);%0A%09%09%09%09%09%09%09sum += c;%0A%09%09%09%09%09%09%7D%0A%09%09%09%09%09%7D%0A%09%09%09%09%09else%09%09//add product to array list and sum%0A%09%09%09%09%09%7B%0A%09%09%09%09%09%09solutions.add(c);%0A%09%09%09%09%09%09sum += c;%0A%09%09%09%09%09%7D%0A%09%09%09%09%7D%0A%09%09%09%7D%0A%09%09%7D%0A%09%09System.out.println(sum);%0A%09%7D%0A%7D%0A

Add problem 32 solution