How is LinkedList's add(int, E) of O(1) complexity?

Question

From the linked-list tag wiki excerpt:

A linked list is a data structure in which the elements contain references to the next (and optionally the pr

Answer 1

The operation of linking the new node to any node is O(1) but the operation of finding (helps to the loop) the concerned index is definitely O(n).

There is no magic ;)