Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Can we reverse a linked list in less than O(n)?

It is not possible to reverse a simple singly linked list in less than O(n). A simple singly linked list can only be reversed in O(n) time using recursive and iterative methods. 

A doubly linked list with head and tail pointers while only requiring swapping the head and tail pointers which require lesser operations than a singly linked list can also not be done in less than O(n) since we need to traverse till the end of the list anyway to find the tail node.

This article is contributed by Abhishek and moharibishal
 

Article Tags :
DSA
Linked List
Recommended Articles
1. XOR Linked List - Reverse a Linked List in groups of given size
2. XOR linked list: Reverse last K nodes of a Linked List
3. Check if a given number is one less than twice its reverse
4. Sum and Product of all the nodes which are less than K in the linked list
5. When is Doubly Linked List more Efficient than Singly Linked List?
6. Largest number with maximum trailing nines which is less than N and greater than N-D
7. Largest number less than N with digit sum greater than the digit sum of N
8. Highest and Smallest power of K less than and greater than equal to N respectively
9. Sum of all array elements less than X and greater than Y for Q queries
10. For each A[i] find smallest subset with all elements less than A[i] sum more than B[i]
11. Find minimum integer greater than B that is product of two values less than A
12. Queries for greater than and not less than
13. Count the number of words having sum of ASCII values less than and greater than k
14. Count of alphabets having ASCII value less than and greater than k
15. Greatest number less than equal to B that can be formed from the digits of A
16. Count N-length arrays made from first M natural numbers whose subarrays can be made palindromic by replacing less than half of its elements
17. Check if any subarray can be made palindromic by replacing less than half of its elements
18. Check if given Array can be reduced to 0 by removing element less than K and adding it to K
19. Can Run Time Complexity of a comparison-based sorting algorithm be less than N logN?
20. Minimize X such that array can made 0 by reducing elements less than X
21. Find maximum LCM that can be obtained from four numbers less than or equal to N
22. Check if X and Y elements can be selected from two arrays respectively such that the maximum in X is less than the minimum in Y
23. Check if all array elements can be reduced to less than X
24. Length of longest subarray in which elements greater than K are more than elements not greater than K
25. Check if a triplet of buildings can be selected such that the third building is taller than the first building and smaller than the second building