Can you tell the time complexity for searching an element in a hashmap?

Can you tell the time complexity for searching an element in a hashmap?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, de-shaw, company-specific

目标公司: D. E. Shaw

参考答案摘要

Be it search, insert or delete the time taken by a Hashmap for performing these operations in Java is O(1), Note that O(1) is the best and average-case time but in the worst case it can go up to O(N).

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。