The object of this challenge is to figure out and implement the best algorithm you can. It has to be fast and the code should be well formatted (in terms of style). Please ask about style, but I will not help you with the algorithm.  The Challenge: Write a Java program that takes two arrays of ints as input. It will then print out each number that has a duplicate and the number of duplicates it has.  Extra Credit: Print each number out in order (1's pairs before 2's... etc.)  For example: Given: [1, 6, 12, 5, 1] [1, 6,  1, 3, 3]  The output is: There are 4 pairs of 1s. There are 1 pairs of 6s.  Good luck sweetie :)