# A precarious one

Computer Science Level 2

Given a singly linked list of size $$n>10$$ what is the time complexity of finding the 10th element form the front and the 10th element from the end respectively?

×