I need to know: What is the time complexity of HashMap.containsKey() in java?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
From the
API doc ofHashMap:Since
containsKey()is just aget()that throws away the retrieved value, it’s O(1) (assuming the hash function works properly, again).