Fix: Correct HashMap size tracking and refactor LinkedList methods #7137
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
{O}(1)$ Size Tracking and Encapsulation RefinementThis PR implements a critical fix for size tracking and refactors internal methods for improved efficiency and compliance with Java encapsulation principles in the HashMap data structure.🐛 Problem SolvedThe original HashMap.size() method was incorrect, as it returned the count of non-empty buckets (the array indices) instead of the total number of key-value entries stored across all linked lists. This resulted in the size being misreported whenever hash collisions occurred.