Topic: linked-list-problem / Level: intermediate

• 1951. Write a function to rotate a circular singly linked list left by k positions using an iterative approach.
• 1952. How do you reverse nodes between two given positions m and n in a doubly linked list using recursion?
• 1953. Implement a function to split a circular singly linked list into two lists where one contains prime numbers and the other contains non-prime numbers.
• 1954. Write a function to merge two sorted singly linked lists into one sorted circular doubly linked list without recursion.
• 1955. How do you detect and remove a loop in a singly linked list using a stack?
• 1956. Implement a function to reverse the first half of a doubly linked list using an iterative approach.
• 1957. Write a function to rearrange nodes in a circular singly linked list such that nodes with even values come before nodes with odd values.
• 1958. How do you rotate a circular doubly linked list right by k positions without using extra memory?
• 1959. Implement a function to flatten a multilevel singly linked list where each node may have a child pointer.
• 1960. Write a function to detect the intersection point of two unsorted circular singly linked lists.
• 1961. How do you reverse every alternate node in a circular singly linked list using recursion?
• 1962. Implement a function to rotate a singly linked list left by k positions using recursion.
• 1963. Write a function to split a doubly linked list into two lists based on whether the node values are divisible by a given number.
• 1964. How do you rearrange nodes in a circular singly linked list such that all negative values appear before positive values?
• 1965. Implement a function to detect and remove a loop in a circular singly linked list using recursion.
• 1966. Write a function to reverse every second node in a circular singly linked list using an iterative approach.
• 1967. How do you merge two sorted circular singly linked lists into one sorted doubly linked list without using extra memory?
• 1968. Implement a function to reverse the second half of a circular doubly linked list using recursion.
• 1969. Write a function to rotate a doubly linked list left by k positions using an iterative approach.
• 1970. How do you detect the first node of a loop in a circular doubly linked list using Floyd’s cycle detection?
• 1971. Implement a function to reverse nodes between two positions m and n in a circular singly linked list without recursion.
• 1972. Write a function to split a sorted singly linked list into two lists where one contains prime numbers and the other contains non-prime numbers.
• 1973. How do you rearrange nodes in a singly linked list such that all odd values appear before even values?
• 1974. Implement a function to rotate a circular singly linked list right by k positions using recursion.
• 1975. Write a function to reverse every third node in a circular singly linked list without using recursion.
• 1976. How do you detect and remove a loop in a circular doubly linked list using a two-pointer technique?
• 1977. Implement a function to flatten a multilevel circular singly linked list where each node has both a next pointer and a child pointer.
• 1978. Write a function to rotate a singly linked list left by k positions without using recursion.
• 1979. How do you rearrange nodes in a circular singly linked list such that all even values come before odd values?
• 1980. Implement a function to reverse the first n nodes in a circular singly linked list using an iterative approach.
• 1981. Write a function to split a circular doubly linked list into two lists based on whether the node values are divisible by 4.
• 1982. How do you reverse every second node in a doubly linked list without recursion?
• 1983. Implement a function to detect the intersection point of two unsorted singly linked lists without using extra memory.
• 1984. Write a function to rotate a circular singly linked list right by k positions without recursion.
• 1985. How do you split a doubly linked list into two separate lists where one contains odd-positioned nodes and the other contains even-positioned nodes?
• 1986. Implement a function to merge two sorted doubly linked lists into one sorted circular singly linked list using recursion.
• 1987. Write a function to reverse every second node in a singly linked list using recursion.
• 1988. How do you rearrange nodes in a circular singly linked list such that all negative values come before non-negative values?
• 1989. Implement a function to reverse nodes between two positions m and n in a circular doubly linked list using recursion.
• 1990. Write a function to rotate a circular doubly linked list left by k positions using recursion.
• 1991. How do you detect and remove a loop in a circular singly linked list using a stack?
• 1992. Implement a function to rotate a doubly linked list right by k positions using recursion.
• 1993. Write a function to split a singly linked list into two separate lists where one contains nodes with values divisible by 5.
• 1994. How do you reverse every alternate node in a circular singly linked list without recursion?
• 1995. Implement a function to flatten a multilevel circular doubly linked list where each node has a child pointer.
• 1996. Write a function to rearrange nodes in a circular singly linked list such that nodes with odd-positioned values come before even-positioned values.
• 1997. How do you merge two unsorted singly linked lists into one sorted circular singly linked list without recursion?
• 1998. Implement a function to reverse the second half of a doubly linked list without using recursion.
• 1999. Write a function to detect and remove a loop in a circular singly linked list using Floyd’s cycle detection.
• 2000. How do you rotate a singly linked list right by k positions without recursion?

• More Levels

• Beginner
• Advanced