@@ -0,0 +1,1037 @@
+// http://codingbat.com/prob/p196409%0A%0Apublic int maxMirror(int%5B%5D nums) %7B%0A    int maxMirrorLength = 0;%0A    %0A    for (int i = 0; i %3C nums.length; ++i) %7B%0A        for (int j = nums.length-1; j %3E= 0; --j) %7B%0A            int mirrorLength = 0;%0A            int numberSequenceIndex = i; // initially the start of the original sequence of numbers%0A            int mirrorSequenceIndex = j; // initially the start of the %22mirror%22%0A            %0A            while (numberSequenceIndex %3C nums.length && %0A                   mirrorSequenceIndex %3E= 0 && %0A                   nums%5BnumberSequenceIndex%5D == nums%5BmirrorSequenceIndex%5D) %0A            %7B%0A                mirrorLength++;%0A                numberSequenceIndex++;%0A                mirrorSequenceIndex--;%0A            %7D%0A                                                                              %0A            maxMirrorLength = Math.max(maxMirrorLength, mirrorLength);%0A        %7D%0A    %7D%0A                                                                                            %0A    return maxMirrorLength;%0A%7D%0A

Create maxMirror.java