linter solve

Author: BamaCharanChhandogi

src/main/java/com/thealgorithms/bitmanipulation/HighestSetBit.java

@@ -14,17 +14,17 @@ public final static Optional<Integer> findHighestSetBit(int num) {
         if (num < 0) {
             throw new IllegalArgumentException("Input cannot be negative");
         }
-        
+
         if (num == 0) {
             return Optional.empty();
         }
-        
+
         int position = 0;
         while (num > 0) {
             num >>= 1;
             position++;
         }
-    
+        
         return Optional.of(position - 1);
     }
 }

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

@@ -16,9 +16,6 @@ void testHighestSetBit() {
         assertEquals(5, HighestSetBit.findHighestSetBit(37).orElse(-1));
         assertFalse(HighestSetBit.findHighestSetBit(0).isPresent());
         assertEquals(0, HighestSetBit.findHighestSetBit(1).orElse(-1));
-        
-        // Use assertThrows with a specific exception type and provide a lambda
         assertThrows(IllegalArgumentException.class, () -> HighestSetBit.findHighestSetBit(-37).orElse(-1));
     }
-}
-
+}