Hashing

Group Anagrams

Pair-problem hashing stores complements, groups, or signatures so matching items are found without nested loops.

Kind

pair

Time

O(N) expected

Space

O(N)

Steps

Input Keys

tea

[0]

eat

[1]

tan

[2]

ate

[3]

nat

[4]

bat

[5]

Hash Table / State

bucket 0

empty

bucket 1

empty

bucket 2

empty

bucket 3

empty

bucket 4

empty

bucket 5

empty

bucket 6

empty

Step Timeline

Code + Variables

1for each value x

2    need = target - x

3    if need exists, answer found

4    store x in map

words6

Loading Lab...