@@ -0,0 +1,777 @@
+package algorithm.bitmanipulation;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0A%0D%0Apublic class LonelyInteger %7B%0D%0A%09public static class Solution %7B%0D%0A%0D%0A%09%09private static void lonelyInteger(int%5B%5D ar) %7B%0D%0A%09%09%09int result = 101;%0D%0A%09%09%09for (int i : ar) %7B%0D%0A%09%09%09%09result = result %5E i;%0D%0A%09%09%09%7D%0D%0A%09%09%09result = result %5E101;%0D%0A%09%09%09System.out.println(result);%0D%0A%09%09%7D%0D%0A%0D%0A        public static void main(String%5B%5D args) %7B%0D%0A            try (Scanner in = new Scanner(System.in)) %7B%0D%0A                int n = in.nextInt();%0D%0A                int%5B%5D ar = new int%5Bn%5D;%0D%0A                for (int i = 0; i %3C n; i++) %7B%0D%0A                    ar%5Bi%5D = in.nextInt();%0D%0A                %7D%0D%0A                lonelyInteger(ar);%0D%0A            %7D%0D%0A        %7D%0D%0A    %7D%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        Solution.main(null);%0D%0A    %7D%0D%0A%7D%0D%0A

Add Solution to the LonleyInteger problem