AniketTheProgrammer
Home
(current)
Courses
Projects
YT Projects
Coding Questions
Notification
Contact Us
Log In
All Topics
C Language
C++ Language
Greedy Algorithm
Hashing
Java Language
Linked List
Python
Queue
Stack
String
Sorting
Searching
Recursion
Backtracking
Dynamic Programming
Graph Theory
Bit Manipulation
Mathematics
Sliding Window Technique
Divide And Conquer
Matrix Manipulation
Two Pointers
Binary Tree
Topic: Linked-list-question / Level: Beginner
121. Split a singly linked list into even and odd positioned nodes.
122. Split a doubly linked list into even and odd positioned nodes.
123. Split a circular doubly linked list into even and odd positioned nodes.
124. Merge two linked lists alternatively.
125. Merge two doubly linked lists alternatively.
126. Merge two circular linked lists alternatively.
127. Merge two circular doubly linked lists alternatively.
128. Delete all even-positioned nodes from a singly linked list.
129. Delete all even-positioned nodes from a doubly linked list.
130. Delete all even-positioned nodes from a circular linked list.
131. Delete all even-positioned nodes from a circular doubly linked list.
132. Delete all odd-positioned nodes from a singly linked list.
133. Delete all odd-positioned nodes from a doubly linked list.
134. Delete all odd-positioned nodes from a circular linked list.
135. Delete all odd-positioned nodes from a circular doubly linked list.
136. Swap the first and last nodes of a singly linked list.
137. Swap the first and last nodes of a doubly linked list.
138. Swap the first and last nodes of a circular linked list.
139. Swap the first and last nodes of a circular doubly linked list.
140. Delete all nodes with even values from a singly linked list.
141. Delete all nodes with even values from a doubly linked list.
142. Delete all nodes with even values from a circular linked list.
143. Delete all nodes with even values from a circular doubly linked list.
144. Delete all nodes with odd values from a singly linked list.
145. Delete all nodes with odd values from a doubly linked list.
146. Delete all nodes with odd values from a circular linked list.
147. Delete all nodes with odd values from a circular doubly linked list.
148. Swap adjacent nodes in a singly linked list.
149. Swap adjacent nodes in a doubly linked list.
150. Swap adjacent nodes in a circular linked list.
Previous
1
2
3
4
5
6
7
Next
More Levels
Intermediate
Advanced
Most Visited
Insert a node at the head of a singly linked list.
Design a distributed hash table where linked lists store the keys.
Split a singly linked list into even and odd positioned nodes.
Implement the Bellman-Ford algorithm using linked lists for edge relaxation.
Merge two circular doubly linked lists alternatively.
Merge two circular doubly linked lists in sorted order.
Split a doubly linked list into two sublists based on a given pivot value.
Reverse the sublists of a circular linked list where the sum of node values is even.
Reverse the data of a circular linked list (without changing node links).
Merge two circular doubly linked lists.
Perform range minimum queries on a circular doubly linked list using sparse tables.
Perform tree traversal using a circular doubly linked list to store nodes at each level.
Implement a function to print a linked list in reverse order without using recursion.
Implement a hash table where collision resolution is done using doubly linked lists.
Find the largest sublist with consecutive elements in a doubly linked list.