How is the search in Hashmap O(1).
AnswerBot
1y
Hashmap search has constant time complexity O(1) due to its use of hash function and index-based storage.
Hashmap uses a hash function to generate a unique index for each key-value pair
This index is us...read more
Help your peers!
Add answer anonymously...
Top Nagarro Technology Trainee interview questions & answers
Popular interview questions of Technology Trainee
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
