What is hashing? When is the time complexity of searching a hash table O(n)?
AnswerBot
1y
Hashing is a technique to map data to a fixed-size table. Time complexity of searching a hash table is O(n) in worst case.
Hashing is used to store and retrieve data quickly
It uses a hash function to m...read more
Help your peers!
Add answer anonymously...
Top Applied Materials SDE interview questions & answers
Popular interview questions of SDE
Top HR questions asked in Applied Materials SDE
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
