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
31. Remove the last occurrence of an element from a singly linked list.
32. Delete alternate nodes from a singly linked list.
33. Pairwise swap elements in a singly linked list.
34. Move the last element to the front of a singly linked list.
35. Insert a node at the beginning of a circular linked list.
36. Insert a node at the end of a circular linked list.
37. Delete the head node of a circular linked list.
38. Delete the tail node of a circular linked list.
39. Find the length of a circular linked list.
40. Search for an element in a circular linked list.
41. Split a circular linked list into two halves.
42. Check if a circular linked list is sorted.
43. Convert a circular linked list to a singly linked list.
44. Reverse a circular linked list.
45. Merge two circular linked lists.
46. Remove duplicates from an unsorted singly linked list.
47. Find the intersection point of two circular linked lists.
48. Convert a singly linked list to a doubly linked list.
49. Insert a node at the head of a doubly linked list.
50. Insert a node at the tail of a doubly linked list.
51. Insert a node at a specific position in a doubly linked list.
52. Delete the head node of a doubly linked list.
53. Delete the tail node of a doubly linked list.
54. Delete a node at a specific position in a doubly linked list.
55. Reverse a doubly linked list.
56. Print all elements of a doubly linked list.
57. Find the length of a doubly linked list.
58. Search for an element in a doubly linked list.
59. Convert a doubly linked list to a singly linked list.
60. Merge two doubly linked lists.
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.