Python3 Program to Count rotations in sorted and rotated linked list Last Updated : 05 Sep, 2024 Comments Improve Suggest changes Like Article Like Report 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. Python # Program for count number of rotations in # sorted linked list. # Linked list node class Node: def __init__(self, data): self.data = data self.next = None # Function that count number of # rotation in singly linked list. def countRotation(head): # Declare count variable and assign it 1. count = 0 # Declare a min variable and assign to # data of head node. min = head.data # Check that while head not equal to None. while (head != None): # If min value is greater then head->data # then it breaks the while loop and # return the value of count. if (min > head.data): break count += 1 # head assign the next value of head. head = head.next return count # Function to push element in linked list. def push(head, data): # Allocate dynamic memory for newNode. newNode = Node(data) # Assign the data into newNode. newNode.data = data # newNode->next assign the address of # head node. newNode.next = (head) # newNode become the headNode. (head) = newNode return head # Display linked list. def printList(node): while (node != None): print(node.data, end = ' ') node = node.next # Driver code if __name__=='__main__': # Create a node and initialize with None head = None # push() insert node in linked list. # 15 -> 18 -> 5 -> 8 -> 11 -> 12 head = push(head, 12) head = push(head, 11) head = push(head, 8) head = push(head, 5) head = push(head, 18) head = push(head, 15) printList(head); print() print("Linked list rotated elements: ", end = '') # Function call countRotation() print(countRotation(head)) # This code is contributed by rutvik_56 Output15 18 5 8 11 12 Linked list rotated elements: 2Time 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! Comment More infoAdvertise with us Next Article Python3 Program to Count rotations in sorted and rotated linked list kartik Follow Improve Article Tags : Linked List Python Python Programs DSA rotation +1 More Practice Tags : Linked Listpython Similar Reads Python Tutorial | Learn Python Programming Language Python Tutorial â Python is one of the most popular programming languages. Itâs simple to use, packed with features and supported by a wide range of libraries and frameworks. Its clean syntax makes it beginner-friendly.Python is:A high-level language, used in web development, data science, automatio 10 min read DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Python Interview Questions and Answers Python is the most used language in top companies such as Intel, IBM, NASA, Pixar, Netflix, Facebook, JP Morgan Chase, Spotify and many more because of its simplicity and powerful libraries. To crack their Online Assessment and Interview Rounds as a Python developer, we need to master important Pyth 15+ min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Python OOPs Concepts Object Oriented Programming is a fundamental concept in Python, empowering developers to build modular, maintainable, and scalable applications. By understanding the core OOP principles (classes, objects, inheritance, encapsulation, polymorphism, and abstraction), programmers can leverage the full p 11 min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Like