A hash map can add and remove elements in O(1)O(1)O(1), as well as update values associated with a key and check if a key exists, also in O(1)O(1)O(1).
On average case is O(1), but in the worst case is O(n)
1 Matching Annotations
- Jul 2023
-
leetcode.com leetcode.com
-