Topic: linked-list-problem / Level: advanced

• 2901. Write a function to rotate a multilevel circular singly linked list such that every k-th node becomes the new head, preserving the structure of both child and sibling pointers.
• 2902. How do you merge two unsorted circular doubly linked lists into one sorted circular singly linked list using heapsort?
• 2903. Implement a function to reverse every second node in a circular singly linked list without recursion, while preserving the structure of the list.
• 2904. Write a function to flatten a multilevel circular singly linked list where each node contains both forward and backward pointers and random pointers.
• 2905. How do you rearrange nodes in a circular doubly linked list such that nodes with prime values come before composite values, while maintaining the structure?
• 2906. Implement a function to split a sorted singly linked list into two lists where one contains nodes with prime values and the other contains nodes divisible by 3.
• 2907. Write a function to reverse every alternate k-th node in a circular doubly linked list while preserving the relative order of sibling pointers.
• 2908. How do you detect and remove loops in a multilevel circular singly linked list where nodes have both next and child pointers?
• 2909. Implement a function to rotate a circular doubly linked list such that every fourth node becomes the new head, while maintaining the relative order of child pointers.
• 2910. Write a function to flatten a circular singly linked list where each node may have both child and sibling pointers.
• 2911. How do you split a circular singly linked list into two lists where one contains odd-indexed nodes and the other contains even-indexed nodes?
• 2912. Implement a function to merge two sorted circular doubly linked lists where each node contains both next and random pointers.
• 2913. Write a function to reverse every third node in a multilevel circular singly linked list while maintaining the structure of child pointers.
• 2914. How do you rearrange nodes in a doubly linked list such that nodes with even-numbered values come before nodes with odd-numbered values?
• 2915. Implement a function to flatten a multilevel circular singly linked list where each node contains both next and random pointers.
• 2916. Write a function to rotate a circular singly linked list such that every node with a prime value becomes the new head.
• 2917. How do you split a circular singly linked list into two lists where one contains nodes divisible by 3 and the other divisible by 5?
• 2918. Implement a function to reverse every second node in a circular doubly linked list without recursion, while preserving the list structure.
• 2919. Write a function to merge two sorted circular singly linked lists where one contains nodes with odd values and the other contains even values.
• 2920. How do you detect and remove loops in a circular singly linked list where each node has both a forward and a backward pointer?
• 2921. Implement a function to reverse the first n nodes in a multilevel circular singly linked list while leaving the remaining nodes unchanged.
• 2922. Write a function to rearrange nodes in a circular doubly linked list such that all nodes with even-indexed values appear before odd-indexed values.
• 2923. How do you split a circular singly linked list into two lists where one contains prime-indexed nodes and the other contains composite-indexed nodes?
• 2924. Implement a function to rotate a multilevel circular singly linked list such that every second node becomes the new head, while preserving the structure of sibling pointers.
• 2925. Write a function to flatten a multilevel circular doubly linked list where each node contains both forward and sibling pointers.
• 2926. How do you merge k unsorted circular doubly linked lists into one sorted circular singly linked list using merge sort?
• 2927. Implement a function to reverse the second half of a circular singly linked list while maintaining the relative order of the first half.
• 2928. Write a function to split a singly linked list into two lists where one contains nodes with prime-numbered positions and the other contains composite-numbered positions.
• 2929. How do you detect and merge two sorted circular singly linked lists where one list contains both forward and random pointers?
• 2930. Implement a function to flatten a circular singly linked list where each node contains both forward and child pointers.
• 2931. Write a function to rotate a circular doubly linked list such that every k-th node becomes the new head, while preserving the structure of child pointers.
• 2932. How do you rearrange nodes in a multilevel circular singly linked list such that all nodes with prime-numbered positions come before composite-numbered positions?
• 2933. Implement a function to reverse every alternate node in a multilevel circular singly linked list while preserving the list structure.
• 2934. Write a function to split a sorted singly linked list into two lists where one contains prime values and the other contains composite values.
• 2935. How do you flatten a multilevel circular singly linked list where each node contains both forward and backward pointers?
• 2936. Implement a function to merge two sorted circular singly linked lists where each node has both a next and a random pointer.
• 2937. Write a function to reverse every k-th node in a circular doubly linked list without recursion, while preserving the structure of sibling pointers.
• 2938. How do you split a circular singly linked list into two lists where one contains even-positioned nodes and the other contains odd-positioned nodes?
• 2939. Implement a function to rotate a circular singly linked list such that every k-th node becomes the new head, while preserving the relative order of child pointers.
• 2940. Write a function to flatten a multilevel circular singly linked list where each node contains both next and child pointers.
• 2941. How do you detect the first common node in two multilevel circular singly linked lists where each list contains both forward and backward pointers?
• 2942. Implement a function to reverse the first half of a doubly linked list while maintaining the relative order of the second half.
• 2943. Write a function to rearrange nodes in a circular singly linked list such that all prime-numbered positions come before composite-numbered positions.
• 2944. How do you split a circular doubly linked list into two lists where one contains nodes divisible by 2 and the other contains nodes divisible by 4?
• 2945. Implement a function to reverse every alternate node in a circular singly linked list without recursion, while preserving the relative order of sibling nodes.
• 2946. Write a function to merge two sorted circular doubly linked lists into one sorted circular singly linked list using heapsort.
• 2947. How do you detect and remove loops in a multilevel circular singly linked list where each node contains both child and random pointers?
• 2948. Implement a function to rotate a circular singly linked list such that every k-th node becomes the new head, while maintaining the structure of sibling pointers.
• 2949. Write a function to flatten a multilevel circular doubly linked list where each node contains both forward and backward pointers.
• 2950. How do you rearrange nodes in a multilevel circular singly linked list such that all nodes with prime values come before composite values?

• More Levels

• Beginner
• Intermediate