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
61. Find the middle element of a doubly linked list.
62. Remove duplicates from a sorted doubly linked list.
63. Check if two doubly linked lists are identical.
64. Rotate a doubly linked list by k positions.
65. Find the nth node from the end of a doubly linked list.
66. Find the maximum element in a doubly linked list.
67. Find the minimum element in a doubly linked list.
68. Swap two nodes in a doubly linked list.
69. Move the last element to the front of a doubly linked list.
70. Insert a node in a sorted doubly linked list.
71. Delete alternate nodes from a doubly linked list.
72. Pairwise swap elements in a doubly linked list.
73. Delete all nodes with a given value from a doubly linked list.
74. Remove the last occurrence of an element from a doubly linked list.
75. Find if a doubly linked list is a palindrome.
76. Clone a doubly linked list with random pointers.
77. Insert a node at the beginning of a circular doubly linked list.
78. Insert a node at the end of a circular doubly linked list.
79. Delete the head node of a circular doubly linked list.
80. Delete the tail node of a circular doubly linked list.
81. Find the length of a circular doubly linked list.
82. Search for an element in a circular doubly linked list.
83. Reverse a circular doubly linked list.
84. Split a circular doubly linked list into two halves.
85. Merge two circular doubly linked lists.
86. Convert a circular doubly linked list to a doubly linked list.
87. Remove duplicates from an unsorted doubly linked list.
88. Find the intersection point of two circular doubly linked lists.
89. Insert a node at a specific position in a circular doubly linked list.
90. Rotate a circular doubly linked list by k positions.
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.