refactor: clean long division code

Author: saahil-mahato

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

@@ -46,19 +46,12 @@ public static int divide(int dividend, int divisor) {
                     quotient++;
                 }
                 answer.append(quotient);
-            } else if (part1 == newDivisor1) {
-                int quotient = 0;
-                while (part1 >= newDivisor1) {
-                    part1 = part1 - newDivisor1;
-                    quotient++;
-                }
-                answer.append(quotient);
             } else if (part1 == 0) {
                 answer.append(0);
             } else if (part1 < newDivisor1) {
                 answer.append(0);
             }
-            if (!(part1 == 0)) {
+            if (part1 != 0) {
                 remainder = String.valueOf(part1);
             } else {
                 remainder = "";

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

@@ -4,7 +4,7 @@
 
 import org.junit.jupiter.api.Test;
 
-public class LongDivisionTest {
+class LongDivisionTest {
 
     // Requirement: Dividend (positive) is  greater than divisor (positive), returns correct integer
     // after division