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
181. Reverse the data of a circular doubly linked list (without changing node links).
182. Rotate a singly linked list counterclockwise by k positions.
183. Rotate a doubly linked list counterclockwise by k positions.
184. Rotate a circular linked list counterclockwise by k positions.
185. Rotate a circular doubly linked list counterclockwise by k positions.
186. Rotate a singly linked list clockwise by k positions.
187. Rotate a doubly linked list clockwise by k positions.
188. Rotate a circular linked list clockwise by k positions.
189. Rotate a circular doubly linked list clockwise by k positions.
190. Insert a node after every kth node in a singly linked list.
191. Insert a node after every kth node in a doubly linked list.
192. Insert a node after every kth node in a circular linked list.
193. Insert a node after every kth node in a circular doubly linked list.
194. Split a singly linked list into a list of even and odd values.
195. Split a doubly linked list into a list of even and odd values.
196. Split a circular linked list into a list of even and odd values.
197. Split a circular doubly linked list into a list of even and odd values.
198. Reverse the first half of a singly linked list.
199. Reverse the first half of a doubly linked list.
200. Reverse the first half of 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.