@@ -0,0 +1,1134 @@
+package algorithms.bit_manipulation;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0A/*%0D%0A * Problem Statement: %0D%0A * You will be given a list of 32 bits unsigned integers. You are required to%0D%0A * output the list of the unsigned integers you get by flipping bits in its%0D%0A * binary representation (i.e. unset bits must be set, and set bits must be%0D%0A * unset).%0D%0A * %0D%0A * Input Format: %0D%0A * The first line of the input contains the list size T, which is followed by T%0D%0A * lines, each line having an integer from the list.%0D%0A * %0D%0A * Constraints: %0D%0A * 1 %3C= T %3C= 100%0D%0A * 0 %3C= integer %3C 232%0D%0A * %0D%0A * Output Format: %0D%0A * Output one line per element from the list with the requested result.%0D%0A * %0D%0A * Sample Input: %0D%0A * 3%0D%0A * 2147483647%0D%0A * 1%0D%0A * 0%0D%0A * %0D%0A * Sample Output: %0D%0A * 2147483648%0D%0A * 4294967294%0D%0A * 4294967295%0D%0A */%0D%0Apublic class FlippingBits %7B%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        %0D%0A        Scanner sc = new Scanner(System.in);%0D%0A        %0D%0A        int numCases = sc.nextInt();%0D%0A        %0D%0A        for (int i = 0; i %3C numCases; i++) %7B%0D%0A            System.out.println(sc.nextLong() %5E 4294967295L);%0D%0A        %7D%0D%0A        sc.close();%0D%0A    %7D%0D%0A%7D

Add FlippingBits