using hamming weight, calculate parity (how many 1s in binary representation) & if parity is odd

Author: ZapDos7

src/binary/hammingWeight/HammingWeight.java

@@ -20,6 +20,15 @@ static int getHammingWeight2(int input) {
         return res;
     }
 
+    // Parity
+    public static int findParity(int n) {
+        return getHammingWeight(n) % 2;
+    }
+
+    public static boolean isParityEven(int n) {
+        return findParity(n) / 2 == 0;
+    }
+
     // String logic
     static int getHammingWeight(int input) {
         var toBinary = Integer.toBinaryString(input);