Is time complexity of HashMap always O(1) ?
AnswerBot
2mo
No, time complexity of HashMap is not always O(1).
Time complexity of HashMap is O(1) on average, but can degrade to O(n) in worst case scenarios.
Worst case scenarios include hash collisions, which can...read more
Help your peers!
Add answer anonymously...
Popular interview questions of Senior Software Engineer
>
GE Aviation Senior Software Engineer Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
