What is the difference between hashmap and arraylist?
- 1 Answers
- 1092 Views
- I also Faced
- E-Mail Answers
Answer / Abhash Mitra
A HashMap is a data structure that implements an associative array or dictionary, storing key-value pairs. An ArrayList, on the other hand, is a dynamic array that can resize itself as elements are added or removed. The main difference lies in their methods of accessing and retrieving data - HashMap uses keys, while ArrayList uses indexes.
| Is This Answer Correct ? | 0 Yes | 0 No |
What do you mean by open addressing?
Should I use hashmap or hashtable?
Can arraylist shrink?
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
What is array sort?
What does arraylist remove return?
Why insertion is faster in linked list?
Can we put null key in hashmap?
What is binary search in programming?
Define root?
What are the advantages of merge sort?
What do u mean by array?
Windows 
