ArrayList and Vector are efficient to use for searching when the index is known. Time complexity of O(1). ArrayList is faster than Vector because Vector is synchronized.
The LinkedList is efficient for adding/removing elements because it has to only change the pointer values (time complexity of O(1)), whereas the ArrayList and Vector will need to move the objects.