Topic: linked-list-problem / Level: intermediate

• 1001. Write a function to detect and remove a cycle in a singly linked list using Floyd’s cycle-finding algorithm.
• 1002. Implement a function to merge two sorted doubly linked lists into one sorted circular doubly linked list.
• 1003. Write a function to reverse the order of alternate nodes in a circular singly linked list and append them at the end.
• 1004. How do you rotate a doubly linked list to the right by k positions?
• 1005. Implement a function to detect if two singly linked lists intersect and find the intersection point.
• 1006. Write a function to reverse every k nodes in a doubly linked list, but preserve the order of remaining nodes.
• 1007. How do you merge two sorted linked lists where each node contains a random pointer to any other node in the list?
• 1008. Implement a function to remove all occurrences of a given value from a circular doubly linked list.
• 1009. Write a function to check if a singly linked list is a palindrome using a stack and two-pointer technique.
• 1010. How do you flatten a linked list where each node has both a next pointer and a child pointer?
• 1011. Implement a function to rotate a singly linked list left by k positions.
• 1012. Write a function to reverse a doubly linked list in groups of k nodes using recursion.
• 1013. How do you merge k sorted singly linked lists using a min heap?
• 1014. Implement a function to split a circular doubly linked list into two equal halves.
• 1015. Write a function to find the intersection of two unsorted singly linked lists.
• 1016. How do you reverse a linked list using XOR linked list concept?
• 1017. Implement a function to delete nodes from a singly linked list whose sum of values equals a given target value.
• 1018. Write a function to merge two circular doubly linked lists, alternating nodes from each list.
• 1019. How do you check if two linked lists are identical in terms of structure and data?
• 1020. Implement a function to remove every k-th node from a singly linked list.
• 1021. Write a function to rearrange a doubly linked list such that all even-positioned nodes are before odd-positioned nodes.
• 1022. How do you find the first node of a loop in a singly linked list using a two-pointer technique?
• 1023. Implement a function to convert a binary search tree to a doubly linked list.
• 1024. Write a function to rotate a circular singly linked list by k positions.
• 1025. How do you reverse a doubly linked list without using extra space?
• 1026. Implement a function to insert a node at the middle of a circular doubly linked list.
• 1027. Write a function to remove all nodes from a doubly linked list that are greater than the average of the list.
• 1028. How do you merge two linked lists where one is sorted in ascending order and the other in descending order?
• 1029. Implement a function to reverse every alternate group of k nodes in a singly linked list.
• 1030. Write a function to detect a loop in a circular doubly linked list.
• 1031. How do you flatten a multilevel doubly linked list where each node may have multiple children?
• 1032. Implement a function to swap pairs of nodes in a circular singly linked list without swapping data.
• 1033. Write a function to reverse nodes in a doubly linked list between two given positions m and n.
• 1034. How do you merge two unsorted circular singly linked lists into one sorted list without duplicates?
• 1035. Implement a function to delete nodes from a singly linked list where the node value is greater than the sum of its neighbors.
• 1036. Write a function to rearrange a linked list such that even and odd indexed nodes are in alternate positions.
• 1037. How do you find the k-th node from the end of a circular singly linked list in a single pass?
• 1038. Implement a function to convert a sorted singly linked list into a balanced binary search tree.
• 1039. Write a function to remove the last node from a circular doubly linked list without losing its structure.
• 1040. How do you rotate a doubly linked list left by k positions?
• 1041. Implement a function to reverse every k nodes in a circular doubly linked list using an iterative approach.
• 1042. Write a function to find the union and intersection of two singly linked lists.
• 1043. How do you rearrange a singly linked list such that all negative numbers appear before positive numbers?
• 1044. Implement a function to remove nodes from a doubly linked list whose values are prime numbers.
• 1045. Write a function to merge two sorted linked lists where each node contains a random pointer to another node in the list.
• 1046. How do you reverse nodes in a doubly linked list between two specified positions without using recursion?
• 1047. Implement a function to check if a circular doubly linked list contains any repeated values.
• 1048. Write a function to rearrange a singly linked list such that nodes with even values appear before nodes with odd values.
• 1049. How do you remove duplicate nodes from an unsorted doubly linked list without using extra space?
• 1050. Implement a function to find the middle node of a circular singly linked list using the two-pointer technique.

• More Levels

• Beginner
• Advanced