dsa-competitive-programming/leetcode/lc1/notes.md

One pass: one pass starts from index 0 and stores it in a map, and for next number in array, it computes the new complement and checks if it’s present in map, if yes then prints else stores the original number in hash and continues

Two pass: Two-pass hash table solution first builds a map of all values to their indices, then makes a second scan through the array to compute each element’s complement and check if it exists in the map.