# Tag Info

In this case, k can vary from 1 to n. 1 We might be interested in finding 1st from Beginning and 1st from End. Time Complexities of these are respectively $O(1)$ and $O(n)$. OR n We might be interested in finding nth Element from Beginning (Last Element of Linked List) and nth Element from End (First Element of Linked List) Time Complexities of these ...