A hash map (jerin-ƙoƙari) yana ba da O(1) matsakaita don neman abubuwa, saka, da gida. Musayar O(n) alaƙa don saurin jiya O(n²) algorithms zuwa O(n) ta hada da sake duba tare da abin da ba ma ji-fi sakamako.
Tunani
Sai dai neman jerin abubuwa kowane lokaci, ma karbar jerin abubuwa da aka ga cikin hash map da gwaji membership a lokaci mai tsawo.
Misali: two-sum a O(n)
():
seen = {}
i, x (nums):
need = target - x
need seen:
(seen[need], i)
seen[x] = i
two_sum([, , , ], )
