@@ -0,0 +1,1238 @@
+package algorithms.bit_manipulation;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0A/*%0D%0A * Problem Statement: %0D%0A * There are N integers in an array A. All but one integer occur in pairs. Your%0D%0A * task is to find the number that occurs only once.%0D%0A * %0D%0A * Input Format: %0D%0A * The first line of the input contains an integer N, indicating the number of%0D%0A * integers. The next line contains N space-separated integers that form the%0D%0A * array A.%0D%0A * %0D%0A * Constraints: %0D%0A * 1 %3C= N %3C 100%0D%0A * N %25 2=1 (N is an odd number)%0D%0A * 0 %3C= A%5Bi%5D %3C= 100, every i is an element of %5B1,N%5D%0D%0A * %0D%0A * Output Format: %0D%0A * Output S, the number that occurs only once.%0D%0A * %0D%0A * Sample Input:1 %0D%0A * 1%0D%0A * 1%0D%0A * %0D%0A * Sample Output:1 %0D%0A * 1%0D%0A * %0D%0A * Sample Input:2 %0D%0A * 3%0D%0A * 1 1 2%0D%0A * %0D%0A * Sample Output:2 %0D%0A * 2%0D%0A * %0D%0A * Sample Input:3 %0D%0A * 5%0D%0A * 0 0 1 2 1%0D%0A * %0D%0A * Sample Output:3 %0D%0A * 2%0D%0A */%0D%0Apublic class LonelyInteger %7B%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        Scanner sc = new Scanner(System.in);%0D%0A        %0D%0A        int numInts = sc.nextInt();%0D%0A        %0D%0A        int a = 0;%0D%0A        %0D%0A        for (int i = 0; i %3C numInts; i++) %7B%0D%0A            int num = sc.nextInt();%0D%0A            a %5E= num;%0D%0A        %7D%0D%0A        System.out.println(a);%0D%0A        sc.close();%0D%0A    %7D%0D%0A%7D

Add LonelyInteger