Skip to main content

Hash Vis

Key-Value Optimization

Initializing Hashing Canvas...

Playback Speed1x
Hashing Internals
Best Time
Ω(1)
Worst Time
O(n)
Aux Space
Θ(1)
Hashing Logic
1Algorithm TwoSum(nums, target):
2 Set map = new HashMap()
3 For each i, num in nums:
4 complement = target - num
5 If complement in map:
6 Return [map[complement], i]
7 map[num] = i
8 Return []