Removed clearLowestSetBit(int n) from the file

Author: ishanki19-pixel

src/test/java/com/thealgorithms/bitmanipulation/LowestSetBitTest.java

@@ -10,38 +10,23 @@ public class LowestSetBitTest {
     @Test
     public void testIsolateLowestSetBit() {
         // Test with regular positive numbers
-        assertEquals(1, lowestSetBit.isolateLowestSetBit(5));  // 5 in binary is 101, the lowest set bit is 1
-        assertEquals(2, lowestSetBit.isolateLowestSetBit(6));  // 6 in binary is 110, the lowest set bit is 2
-        assertEquals(4, lowestSetBit.isolateLowestSetBit(12)); // 12 in binary is 1100, the lowest set bit is 4
+        assertEquals(1, lowestSetBit.isolateLowestSetBit(5));
+        assertEquals(2, lowestSetBit.isolateLowestSetBit(6));
+        assertEquals(4, lowestSetBit.isolateLowestSetBit(12));
 
         // Test with powers of two
-        assertEquals(1, lowestSetBit.isolateLowestSetBit(1));  // 1 in binary is 1, the lowest set bit is 1
-        assertEquals(2, lowestSetBit.isolateLowestSetBit(2));  // 2 in binary is 10, the lowest set bit is 2
-        assertEquals(4, lowestSetBit.isolateLowestSetBit(4));  // 4 in binary is 100, the lowest set bit is 4
+        assertEquals(1, lowestSetBit.isolateLowestSetBit(1));
+        assertEquals(2, lowestSetBit.isolateLowestSetBit(2));
+        assertEquals(4, lowestSetBit.isolateLowestSetBit(4));
 
         // Test with negative numbers
-        assertEquals(1, lowestSetBit.isolateLowestSetBit(-5)); // -5 in binary (two's complement) still has 1 as the lowest set bit
-        assertEquals(2, lowestSetBit.isolateLowestSetBit(-6)); // -6 in binary has 2 as the lowest set bit
+        assertEquals(1, lowestSetBit.isolateLowestSetBit(-5));
+        assertEquals(2, lowestSetBit.isolateLowestSetBit(-6));
 
         // Test with zero
-        assertEquals(0, lowestSetBit.isolateLowestSetBit(0));  // Edge case: 0 should return 0
+        assertEquals(0, lowestSetBit.isolateLowestSetBit(0));
 
         // Test with number having all bits set
-        assertEquals(1, lowestSetBit.isolateLowestSetBit(-1)); // -1 in two's complement has all bits set, lowest set bit is 1
-    }
-
-    @Test
-    public void testClearLowestSetBit() {
-        // Test with positive numbers
-        assertEquals(4, lowestSetBit.clearLowestSetBit(5));  // 5 in binary is 101, clearing lowest set bit gives 100 (which is 4)
-        assertEquals(4, lowestSetBit.clearLowestSetBit(6));  // 6 in binary is 110, clearing lowest set bit gives 100 (which is 4)
-        assertEquals(8, lowestSetBit.clearLowestSetBit(12)); // 12 in binary is 1100, clearing lowest set bit gives 1000 (which is 8)
-
-        // Test with negative numbers
-        assertEquals(-6, lowestSetBit.clearLowestSetBit(-5)); // -5 in binary, clearing lowest set bit should give -6
-        assertEquals(-8, lowestSetBit.clearLowestSetBit(-6)); // -6 in binary, clearing lowest set bit should give -8
-
-        // Test with zero
-        assertEquals(0, lowestSetBit.clearLowestSetBit(0));   // Edge case: 0 should return 0
+        assertEquals(1, lowestSetBit.isolateLowestSetBit(-1));
     }
 }