What is the average lookup complexity of std::unordered_map?
- A O(1)
- B O(log n)
- C O(n)
- D O(n log n)
Answer
O(1)
unordered_map is a hash table with O(n) worst case. std::map is a balanced tree with guaranteed O(log n) and sorted iteration.
Login to manage your account
Fill out the form to get started
We'll email you a 6-digit code to reset your password
You can now log in with your new password.
Log in or sign up below — if your email isn't verified yet, we'll send you a code to confirm it right here.
We've sent a 6-digit code to . Enter it below to verify your account.
You'll have 10 minutes to discuss questions matched to your target role. Submit when you're done to get feedback.
Here's what we've saved to your candidate profile — this is what powers your personalized mock interviews.
Prepare with AI-powered mock interviews. Simulate real interview scenarios, receive instant feedback, and fine-tune your performance to stand out.
Your resume and interview profile are already saved — jump straight into a live AI interview now with your saved details.
O(1)
unordered_map is a hash table with O(n) worst case. std::map is a balanced tree with guaranteed O(log n) and sorted iteration.
All trademarks are the property of their respective owners
All rights reserved @ 2026 Nishtya Infotech (India) Ltd.
Login to manage your account
Fill out the form to get started
Instructions will be sent to you
Don't have an account yet? Sign up
Don't have an account yet? Sign up
Already have an account? Log in
By continuing you agree to our Terms and Conditions
Enter the email address you used when you joined and we'll send you instructions to reset your password.
.jpg)
.jpg)
Fill out the form to get started
Instructions will be sent to you
Log in with Google
Log in with LinkedIn