feeat: completes Hamming weight exercise

Author: SC

csharp/18_BitManipulation/L191-NumberOfOneBits/Solution.cs

@@ -1,8 +1,27 @@
 namespace _18_BitManipulation.L191_NumberOfOneBits;
 
 public class Solution {
-    public int HammingWeight(uint n)
+    public int HammingWeightByMod(uint n)
     {
-        throw new NotImplementedException();
+        var numberOfOnes = 0;
+        
+        for (int i = 0; i < 32; i++)
+        {
+            // select the order of magnitued in base 2
+            // by bit-shifting 1
+            var shiftedI = 1 << i;
+            
+            // bitwise logical AND
+            // 0 * 0 = 0
+            // 0 * 1 = 0
+            // 1 * 1 = 1
+            var bitWiseMultip = shiftedI & n;
+
+            // increase number of 1 bits
+            if (bitWiseMultip != 0) 
+                numberOfOnes++;
+        }
+
+        return numberOfOnes;
     }
 }

csharp/18_BitManipulation_Tests/L191_NumberOfOneBits_Tests.cs

@@ -10,11 +10,17 @@ public class L191_NumberOfOneBits_Tests
     [Test]
     public void Example1_Test()
     {
-        uint input = 10111;
-
+        uint input = 0b10111;
+        var x = input << 1;
+        byte a = 3;
+        byte b = 0b_0011;
+        bool c = a == b;
+        
+        
         var solution = new Solution();
-        var result = solution.HammingWeight(input);
+        var result = solution.HammingWeightByMod(input);
 
         result.Should().Be(4);
+
     }
 }