Answer / Gurvindra Singh

HashMaps, or dictionaries, are used for fast lookup, insertion, and deletion of key-value pairs. They are essential data structures in many algorithms and applications that require efficient access to a large amount of data.

Explain the internal working of a hash map?

1 Answers  

---

Can you declare an array without assigning the size of an array?

0 Answers  

---

What type of data structure is used to perform recursion?

1 Answers  

---

Is data structure a data type?

1 Answers  

---

What are the different types of data type?

1 Answers  

---

If you have to store one lakh objects, what will be a better option- a hash map or an array list?

1 Answers   DELL,

---

Can treeset contain duplicates?

1 Answers  

---

What is the default size of arraylist?

1 Answers  

---

What are the data structures used in RDBMS, Network data model & Hierarchical data model?

1 Answers   Accenture,

---

Is file a data structure?

1 Answers  

---

Why is map not a collection?

1 Answers  

---

Which is faster array or list?

1 Answers  

---