Linked List vs Vector

Question

Over the past few days I have been preparing for my very first phone interview for a software development job. In researching questions I have come up with this article.

Answer 1

As a correction on the Big O time of insertion and deletion within a linked list, if you have a pointer that holds the position of the current element, and methods used to move it around the list, (like .moveToStart(), .moveToEnd(), .next() etc), you can remove and insert in constant time.