Fix formatting: remove trailing spaces and apply clang-format

Author: ruturajjadhav07

src/main/java/com/thealgorithms/maths/HappyNumber.java

@@ -4,12 +4,12 @@
  * A Happy Number is defined as a number which eventually reaches 1 when replaced
  * by the sum of the squares of each digit.
  * If it falls into a cycle that does not include 1, then it is not a happy number.
- *
+
  * Example:
- *   19 → 1² + 9² = 82
- *   82 → 8² + 2² = 68
- *   68 → 6² + 8² = 100
- *   100 → 1² + 0² + 0² = 1 → Happy Number!
+ * 19 → 1² + 9² = 82
+ * 82 → 8² + 2² = 68
+ * 68 → 6² + 8² = 100
+ * 100 → 1² + 0² + 0² = 1 → Happy Number!
  */
 public final class HappyNumber {
 
@@ -29,8 +29,8 @@ public static boolean isHappy(int n) {
         int fast = n;
 
         do {
-            slow = sumOfSquares(slow);                   // move 1 step
-            fast = sumOfSquares(sumOfSquares(fast));     // move 2 steps
+            slow = sumOfSquares(slow); // move 1 step
+            fast = sumOfSquares(sumOfSquares(fast)); // move 2 steps
         } while (slow != fast);
 
         return slow == 1; // If cycle ends in 1 → Happy number
@@ -40,7 +40,7 @@ public static boolean isHappy(int n) {
      * Calculates the sum of squares of the digits of a number.
      *
      * Example:
-     *   num = 82 → 8² + 2² = 64 + 4 = 68
+     * num = 82 → 8² + 2² = 64 + 4 = 68
      *
      * @param num The number to calculate sum of squares of digits
      * @return The sum of squares of the digits

src/test/java/com/thealgorithms/maths/HappyNumberTest.java

@@ -26,6 +26,6 @@ void testUnhappyNumbers() {
     @Test
     void testLargeNumber() {
         // Just to check behavior with larger input
-        assertTrue(HappyNumber.isHappy(1000000));  // reduces to 1 eventually
+        assertTrue(HappyNumber.isHappy(1000000)); // reduces to 1 eventually
     }
 }