refactor: clean long division code

[saahil-mahato]

Description

There was a redundant code block in LongDivision.java. This PR simply deletes it and does a few minor code quality modifications.

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 64.13%. Comparing base (9b52ac9) to head (4769e6e).

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #5776      +/-   ##
============================================
- Coverage     64.14%   64.13%   -0.01%     
+ Complexity     4205     4204       -1     
============================================
  Files           587      587              
  Lines         16390    16384       -6     
  Branches       3163     3161       -2     
============================================
- Hits          10513    10508       -5     
  Misses         5448     5448              
+ Partials        429      428       -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

[alxkm]

Why did you remove it? Maybe it wasn't covered by tests? Because it seems to be inefficient but requires code.

Perhaps this could be written more efficiently, like this:

    int quotient = (int) (part1 / newDivisor1);
    part1 = part1 % newDivisor1;
    answer.append(quotient);