# Move last element to front of a given Linked List

• Difficulty Level : Basic
• Last Updated : 24 Jun, 2022

Write a function that moves the last element to the front in a given Singly Linked List. For example, if the given Linked List is 1->2->3->4->5, then the function should change the list to 5->1->2->3->4.

Algorithm: Traverse the list till last node. Use two pointers: one to store the address of last node and other for address of second last node. After the end of loop do following operations.

1. Make second last as last (secLast->next = NULL).

Implementation:

## Javascript



Output:

Linked list before moving last to front
1 2 3 4 5
Linked list after removing last to front
5 1 2 3 4

Time Complexity: O(N)

As we need to traverse the list once.

Auxiliary Space: O(1)

As constant extra space is used.

Please write comments if you find any bug in the above code/algorithm, or find other ways to solve the same problem.

My Personal Notes arrow_drop_up
Recommended Articles
Page :