Refactor Levenshtein distance implementation

[TruongNhanNguyen]

Changes

• Rewrite the original levenshtein distance implementation in functional style
• Add optimized version of levenshtein distance

• 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 37.37%. Comparing base (b3903f5) to head (9d4da7c).

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #5138      +/-   ##
============================================
+ Coverage     37.35%   37.37%   +0.02%     
- Complexity     2350     2351       +1     
============================================
  Files           517      517              
  Lines         15618    15613       -5     
  Branches       2971     2968       -3     
============================================
+ Hits           5834     5836       +2     
+ Misses         9496     9490       -6     
+ Partials        288      287       -1     

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