Optimize and Format Knapsack Memoization Algorithm

[Chiefpatwal]

• 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 63.52%. Comparing base (b81671e) to head (eaf0ea1).

Additional details and impacted files

@@            Coverage Diff            @@
##             master    #5685   +/-   ##
=========================================
  Coverage     63.51%   63.52%           
+ Complexity     4097     4096    -1     
=========================================
  Files           575      575           
  Lines         16085    16083    -2     
  Branches       3090     3089    -1     
=========================================
  Hits          10216    10216           
+ Misses         5451     5450    -1     
+ Partials        418      417    -1     

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

[Chiefpatwal]

This pull request fixes the bug in the KnapsackMemoization class by removing unused imports and optimizing the memoization logic.

[siriak]

Could you add JUnit tests that cover the code you have changed?

[Chiefpatwal]

Could you add JUnit tests that cover the code you have changed?

sure

[Chiefpatwal]

I have added test 4 and test 5 for the same.

[siriak]

Looks good, thanks!