Complexity: O(log(s)) (exist) or O(n) (not exist), where s is the count of the strings with the same length as they key.
See Implementation
Complexity: O(log(s)) (exist) or O(n) (not exist), where s is the count of the strings with the same length as they key.