What is the difference between arraylist and hashmap?



What is the difference between arraylist and hashmap?..

Answer / Vikalpa Narayan Singh

ArrayList is a dynamic array implementation that stores elements in an indexed, sequential order. On the other hand, HashMap is a key-value pair data structure optimized for fast lookup, insertion, and deletion operations.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Data Structures Interview Questions

Which is best book for data structures?

1 Answers  


What is bubble sort?

1 Answers  


Why is selection sort used?

1 Answers  


how to delete first node from singly linked list?

1 Answers  


Why is quicksort not stable?

1 Answers  


Run time memory allocation is known as in data structure?

1 Answers  


Is int a data structure?

1 Answers  


What do you mean by spanning tree?

1 Answers   TCS,


Is pointer a variable in data structure?

1 Answers  


You want to insert a new item in a binary search tree. How would you do it?

1 Answers  


How to cut or remove an element from the array?

1 Answers  


Define a tree?

1 Answers  


Categories