More Problems

• Write a function to reverse every alternate k-th node in a circular singly linked list.
• How do you implement a linked list that allows efficient random access to nodes using a hash table for indexing?
• Implement a function to rotate a singly linked list such that every k-th node becomes the new head.
• Write a function to merge two sorted linked lists where each node contains both a next pointer and a child pointer.
• How do you implement a circular doubly linked list with a skip pointer for faster traversal?
• Implement a function to reverse the first half of a doubly linked list while leaving the second half unchanged.
• Write a function to detect and merge two linked lists where both lists contain cycles.
• How do you split a circular singly linked list into k lists where each list contains exactly one prime number?