More Problems

• How do you perform a depth-first search (DFS) traversal on a graph implemented as a linked list of adjacency lists?
• Implement a function to perform in-place merge sort on a circular singly linked list.
• Write a function to delete every node from a linked list that matches a specific pattern using regular expressions.
• How do you reverse alternate groups of nodes in a doubly linked list and then merge them into one list?
• Implement a function to rotate a circular doubly linked list such that every third node becomes the new head.
• Write a function to split a singly linked list into k groups where each group contains at least one prime number.
• How do you merge k sorted doubly linked lists into one sorted circular doubly linked list?
• Implement a function to convert a doubly linked list into a balanced binary search tree (BST) in-place.