# data[].attributes.body
Have a hashing algorithm to create addresses/keys for elements

# data[].attributes.body
size is dynamic
takes objects and generics

# data[].attributes.body
no clue on HashMaps

# data[].attributes.body
Arraylist - like array, but is not fixed in length.
HashMap - a bit like two dimentional array

# data[].attributes.headline
Hashmaps require a key to indicate which Element you want. Those Keys can be anything and dont follow a certain order

# data[].attributes.subject
Hashmaps require a key to indicate which Element you want. Those Keys can be anything and dont follow a certain order

# data[].attributes.body
Sounds yummy

# data[].attributes.body
Hashmap?

# data[].attributes.body
Array lists are sets of values of the same type, with indices. HashMaps are sets of values which can have keys as well

# data[].attributes.body
please someone tell me

# data[].attributes.body
ArrayLists are similar to arrays but have a dynamic size that automatically updates based on the number of elements stored within

# data[].attributes.headline
I said a pound of hash is heavier than a pound of feathers!!

# data[].attributes.subject
I said a pound of hash is heavier than a pound of feathers!!

# data[].attributes.headline
ArrayList dynamic Array static, .add is life

# data[].attributes.subject
ArrayList dynamic Array static, .add is life

# data[].attributes.body
p.s wtf is a hash map please stop this madness

# data[].attributes.body
ArrayList is a dynamic type of array which doesn't have fixed length. It uses wrappers.

Nothing about hash maps.

# data[].attributes.headline
arraylists can hold more than one data type

# data[].attributes.subject
arraylists can hold more than one data type

# data[].attributes.body
Need to be imported before they can work

# data[].attributes.body
I don’t know what is “HashMaps”

# data[].attributes.body
Hash maps can be used when dealing with large data

# data[].attributes.headline
ArrayList is bad when it comes to deleting/inserting elements

# data[].attributes.subject
ArrayList is bad when it comes to deleting/inserting elements

# data[].attributes.body
Dynamic, can be transform into array.

# data[].attributes.headline
You can delete only one element at a time with the same content where as with hash maps you can delete two elements at the same time

# data[].attributes.subject
You can delete only one element at a time with the same content where as with hash maps you can delete two elements at the same time

# data[].attributes.headline
Differences between ArrayLists and Hashmaps

# data[].attributes.subject
Differences between ArrayLists and Hashmaps

# data[].attributes.body
Ordering: ArrayLists yes
Hashmaps no
Indexes:  ArrayLists yes
Hasmmaps no

# data[].attributes.body
Methods,
The way the data is stored,
Cannot have duplicates

# data[].attributes.body
Hashmap larger

# data[].attributes.body
holds values like an arraylist but every value has a key connected to it.

arraylists can hold duplicate values but hashmaps cannot have duplicates of the key

# data[].attributes.headline
Within an array list of you want to remove a value that has been entered twice it will remove the first value it finds on the list however, within a hashmap it will remove the value no matter where it is stated within the values. 

# data[].attributes.subject
Within an array list of you want to remove a value that has been entered twice it will remove the first value it finds on the list however, within a hashmap it will remove the value no matter where it is stated within the values. 

# data[].attributes.headline
2 plus 2 is 4 minus 1  thats 3 quick maths

# data[].attributes.subject
2 plus 2 is 4 minus 1  thats 3 quick maths

# data[].attributes.body
This is less efficient when doing operations like quick maffs

# data[].attributes.body
ArrayList maintains the insertion order while HashMap doesn’t.

# data[].attributes.headline
You can have the same elements in an arraylist but only unique in the key of hashmaps

# data[].attributes.subject
You can have the same elements in an arraylist but only unique in the key of hashmaps

# data[].attributes.body
.add() - ArrayList
.put() - HashMaps

# data[].attributes.body
Hash map cannot have key duplicates

# data[].attributes.headline
Hashmaps are dynamic and can remove multiple values 

# data[].attributes.subject
Hashmaps are dynamic and can remove multiple values 

# data[].attributes.body
Hashmaps take a key, which has a stored value. Hashmaps accessed via key whereas arraylists accessed thru indes

# data[].attributes.headline
Array list are longer than hash maps. Hash maps are more suitable to work with large data

# data[].attributes.subject
Array list are longer than hash maps. Hash maps are more suitable to work with large data

# data[].attributes.body
ArrayList maintains the insertion order while HashMap doesn’t.

# data[].attributes.body
HashMaps as the name says, it will map a KEY , to a specific value, that means that we can bring a value using the key

# data[].attributes.body
Hashmaps cannot contain duplicate keys, whereas array lists can contain duplicate values

# data[].attributes.headline
Always display a random list of their elements

# data[].attributes.subject
Always display a random list of their elements

# data[].attributes.body
HashMap performes better when it comes to removing elements

# data[].attributes.body
casts, .ordinal()...

# data[].attributes.body
Ordering: ArrayLists yes
Hashmaps no
Indexes:  ArrayLists yes
Hasmmaps no

# data[].attributes.body
can inly access stuff using .get in hashmap whereas

# data[].attributes.body
hashmaps do not allow duplicate keys but do allow duplicate keys

# data[].attributes.body
Memmory space

# data[].attributes.body
2+2 = 4 -1 = 3

# data[].attributes.body
Array hot

# data[].attributes.body
What is a hashmap