java.util.List

It has the same methods as ArrayList, but it is statically-sized.

List<String> strings = new ArrayList<>();
strings.add("string objects inside an arraylist object!");

All Known Implementing Classes:

ArrayList vs LinkedList

adding to LinkedList is always fast because we save a Pointer to the last node.
- It is slower in ArrayList because we need to reallocate memory and a size for the entire array list, plus the added element.
searching objects by index is faster with an ArrayList because we have the entire contiguous array.
- LinkedList still needs to be traversed to find something in the middle.