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
1. Insert a node at the head of a singly linked list.
2. Insert a node at the tail of a singly linked list.
3. Insert a node at a specific position in a singly linked list.
4. Delete the head node of a singly linked list.
5. Delete the tail node of a singly linked list.
6. Delete a node at a specific position in a singly linked list.
7. Search for an element in a singly linked list.
8. Count the number of nodes in a singly linked list.
9. Reverse a singly linked list.
10. Print all elements of a singly linked list.
11. Find the middle element of a singly linked list.
12. Detect a cycle in a singly linked list.
13. Merge two sorted linked lists.
14. Find the nth node from the end of a singly linked list.
15. Remove duplicates from a sorted singly linked list.
16. Find the intersection point of two singly linked lists.
17. Check if two singly linked lists are identical.
18. Find the length of a singly linked list.
19. Swap two nodes in a singly linked list.
20. Split a singly linked list into two halves.
21. Delete all nodes with a given value from a singly linked list.
22. Find if a singly linked list is a palindrome.
23. Rotate a singly linked list by k positions.
24. Convert a singly linked list to a circular linked list.
25. Insert a node in a sorted singly linked list.
26. Find the maximum element in a singly linked list.
27. Find the minimum element in a singly linked list.
28. Clone a singly linked list with random pointers.
29. Append the last N nodes of a singly linked list to the front.
30. Check if a singly linked list has even or odd length.
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.