mirror of
https://github.com/Manoj-HV30/dsa-competitive-programming.git
synced 2026-05-16 19:35:22 +00:00
16 lines
446 B
Markdown
16 lines
446 B
Markdown
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.
|
||
|