More Problems

• Implement a function to split a doubly linked list into two sublists such that all nodes with values greater than a pivot go to one list.
• Write a function to rearrange a singly linked list such that all nodes with values less than k come before nodes with values greater than or equal to k.
• How do you rotate a circular singly linked list so that the last node becomes the head?
• Implement a function to flatten a multilevel singly linked list with children nodes at different levels.
• Write a function to delete nodes from a circular doubly linked list where each node value is divisible by 3.
• How do you reverse every alternate group of nodes in a doubly linked list?
• Implement a function to check if two circular singly linked lists are anagrams of each other.
• Write a function to merge two sorted doubly linked lists into one sorted linked list without extra memory.