Leetcode Problem 170. Two Sum III - Data structure design

170. Two Sum III - Data structure design

Leetcode Solutions

Initialize a hashtable to store the frequency of each number.
Implement the add(number) method to update the hashtable with the new number.
Implement the find(value) method to iterate through the hashtable keys and check for the existence of the complement.
If the complement exists and is different from the current number, or if it's the same but the frequency is greater than 1, return true.
If no valid pair is found, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen