Topic: linked-list-problem / Level: intermediate

• 1901. Write a function to split a sorted singly linked list into two lists based on whether node values are divisible by 2 or 3.
• 1902. How do you rotate a circular singly linked list right by k positions without recursion?
• 1903. Implement a function to reverse every second node in a circular doubly linked list without recursion.
• 1904. Write a function to merge two sorted circular singly linked lists into one sorted doubly linked list.
• 1905. How do you detect the intersection point of two unsorted doubly linked lists without using extra memory?
• 1906. Implement a function to reverse the second half of a singly linked list using recursion.
• 1907. Write a function to rotate a doubly linked list to the left by k positions using recursion.
• 1908. How do you rearrange nodes in a circular singly linked list such that all odd values come before even values?
• 1909. Implement a function to flatten a multilevel circular doubly linked list where each node has both a next pointer and a child pointer.
• 1910. Write a function to split a circular singly linked list into two lists based on whether the node values are prime or non-prime.
• 1911. How do you rotate a singly linked list left by k positions using an iterative approach?
• 1912. Implement a function to reverse nodes between two given positions m and n in a circular singly linked list using recursion.
• 1913. Write a function to rearrange nodes in a circular singly linked list such that all positive values come before negative values.
• 1914. How do you detect and remove a loop in a doubly linked list using Floyd’s cycle detection algorithm?
• 1915. Implement a function to merge two sorted circular doubly linked lists into one sorted circular singly linked list.
• 1916. Write a function to reverse every third node in a singly linked list without recursion.
• 1917. How do you split a sorted doubly linked list into two lists based on even and odd indexed nodes?
• 1918. Implement a function to rotate a circular singly linked list left by k positions using recursion.
• 1919. Write a function to detect the intersection point of two sorted singly linked lists without using extra space.
• 1920. How do you reverse every second node in a circular singly linked list using an iterative approach?
• 1921. Implement a function to reverse the first half of a circular doubly linked list without recursion.
• 1922. Write a function to rotate a circular singly linked list right by k positions without recursion.
• 1923. How do you rearrange nodes in a doubly linked list such that all even values come before odd values?
• 1924. Implement a function to detect and remove a loop in a circular singly linked list using recursion.
• 1925. Write a function to split a singly linked list into two separate lists based on whether the node values are divisible by 4.
• 1926. How do you rotate a circular singly linked list left by k positions using an iterative approach?
• 1927. Implement a function to reverse every alternate node in a doubly linked list without recursion.
• 1928. Write a function to rearrange nodes in a circular singly linked list such that all negative values come before positive values.
• 1929. How do you detect the first node of a loop in a circular singly linked list using Floyd’s cycle detection?
• 1930. Implement a function to flatten a multilevel singly linked list where each node may have a child pointer.
• 1931. Write a function to reverse the first n nodes in a circular doubly linked list using recursion.
• 1932. How do you merge two sorted singly linked lists into one sorted circular doubly linked list without recursion?
• 1933. Implement a function to rotate a doubly linked list to the left by k positions using recursion.
• 1934. Write a function to rearrange nodes in a singly linked list such that all odd-positioned nodes come before even-positioned nodes.
• 1935. How do you reverse every third node in a circular singly linked list without recursion?
• 1936. Implement a function to reverse the second half of a circular singly linked list without recursion.
• 1937. Write a function to split a doubly linked list into two lists based on whether the node values are prime.
• 1938. How do you rotate a circular singly linked list right by k positions without using recursion?
• 1939. Implement a function to reverse nodes in groups of k in a circular singly linked list using recursion.
• 1940. Write a function to detect and remove a loop in a singly linked list using a two-pointer technique.
• 1941. How do you rearrange nodes in a circular singly linked list such that all prime values come before non-prime values?
• 1942. Implement a function to rotate a singly linked list so that every k-th node becomes the new head.
• 1943. Write a function to reverse every alternate node in a circular doubly linked list without recursion.
• 1944. How do you split a circular singly linked list into two lists where one contains nodes with values divisible by 5?
• 1945. Implement a function to reverse nodes between two positions m and n in a circular singly linked list using an iterative approach.
• 1946. Write a function to rotate a circular singly linked list left by k positions using recursion.
• 1947. How do you detect the intersection point of two sorted doubly linked lists without using extra memory?
• 1948. Implement a function to merge two unsorted singly linked lists into one sorted circular singly linked list.
• 1949. Write a function to reverse every second node in a circular doubly linked list without recursion.
• 1950. How do you rotate a doubly linked list right by k positions using an iterative approach?

• More Levels

• Beginner
• Advanced