Problem List
| Problem Name | Link |
|---|---|
| Basic Problem | |
| Traverse a given linked list | - |
| Count the number of nodes in a linked list | - |
| Print last node data of the Linked list | - |
| Print second last node data of a Linked List | - |
| Check whether given data exist in the linked list | - |
| Print alternate node data of a linled list | - |
| Inertion in Linked List | |
| Insert Node at the beginning of linked list | - |
| Insert a Node at the end of the Linked List | - |
| Insert Node at a given position | - |
| Insert a node in a sorted linked list | - |
| Deletion | |
| Delete the first node of linked list | - |
| Delete the last node of the linked list | - |
| Delete the Kth node of the linked list | - |
| Standard Problems | |
| Print given linked list data in reverse order, using array, stack and recursion | - |
| Reverse a linked list | - |
| Detect a loop in a given linked list | - |