This pull request implements a solution for the "Two Sum" problem using a hash map for efficient lookup of the complement values. The solution has a time complexity of O(n) by iterating through the array only once.
This solution leverages a hash map (object) to store and retrieve the complement values. This ensures O(1) lookup time, making the overall complexity O(n). Should we explore alternative methods, or is this the optimal approach?
The solution assumes that exactly one solution exists and that the same element cannot be used twice. Should additional validation be implemented to handle unexpected input, or is this assumption sufficient?
feat: #109
What does this PR do?