Given a linked list of n nodes which is first sorted, then rotated by k elements. Find the value of k.
The idea is to traverse singly linked list to check condition whether current node value is greater than value of next node. If the given condition is true, then break the loop. Otherwise increase the counter variable and increase the node by node->next. Below is the implementation of this approach.
15 18 5 8 11 12 Linked list rotated elements: 2
Time Complexity: O(n), where n is the number of elements present in the linked list. This is because we are traversing the whole linked list in order to find the count.
Auxiliary Space: O(1), As we are not using any extra space.
Please refer complete article on Count rotations in sorted and rotated linked list for more details!
My Personal Notes arrow_drop_up
Please Login to comment...