JavaBeginner#collections#list

ArrayList vs LinkedList?

ArrayList: backed by a dynamic array, O(1) random access, O(n) insert/delete in the middle. LinkedList: doubly linked, O(1) insert/delete at ends, O(n) random access. Prefer ArrayList for most reads.

Example
List<Integer> al = new ArrayList<>();
al.get(0); // O(1)
LinkedList<Integer> ll = new LinkedList<>();
ll.addFirst(1); // O(1)

Related Questions

1
JavaIntermediate#collections#concurrency

HashMap vs Hashtable vs ConcurrentHashMap?

Open
2
JavaAdvanced#collections#hashmap

How does HashMap work internally?

Open
3
JavaAdvanced#collections

What is the difference between fail-fast and fail-safe iterators?

Open