How is hashmap o 1?
- 1 Answers
- 933 Views
- I also Faced
- E-Mail Answers
Answer / Rajkamal Singh
In a hash map, access or retrieval time complexity is O(1) if the hash function is well-designed and the hash collisions are properly handled, such as using chaining or open addressing techniques.
| Is This Answer Correct ? | 0 Yes | 0 No |
Why null is allowed in hashmap?
List all data structures you would use for a memory management module.
1 Answers HPCL, Hughes Systique Corporation, ITC Indian Tobacco Company,
What is queue example?
What is the purpose of thread?
Mention one advantage and disadvantage of using quadratic probing?
What are the tasks performed while traversing a binary tree?
List some applications of queue data structure.
What is the default size of arraylist?
No. of possible ordered trees with n nodes ? Please give formula (if any).
where do you use double linked list?
Explain about map and their types?
Write a program to reverse a link list.
Windows 
