You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -20,7 +20,7 @@
20
20
| Swap nodes of a linkedlist without swapping data. |[swapNodesWithoutSwappingData.cpp] (linked_list_problems/swapNodesWithoutSwappingData.cpp) |
21
21
| Given a linked list, reverse alternate nodes and append at the end. |[reverseAlternateNodes.cpp](linked_list_problems/reverseAlternateNodes.cpp)|
22
22
| Only given a node pointer, delete the node from the linked list. |[deleteNode.cpp](linked_list_problems/deleteNode.cpp)|
23
-
| Delete the entire linkedlist. |[deleteLinkedlist.cpp](linked_list/deleteLinkedlist.cpp)|
23
+
| Delete the entire linkedlist. |[deleteLinkedlist.cpp](linked_list_problems/deleteLinkedlist.cpp)|
24
24
| Print middle node of linkedlist without iterating twice. |[printMiddleNode.cpp](linked_list_problems/printMiddleNode.cpp)|| Detecting and removing a cycle in linkedlist.|[floyedCycleDetection.cpp](linked_list_problems/floyedCycleDetection.cpp)|
25
25
| Determine if a linked list is a pallindrome. |[listPallindrome.cpp](linked_list_problems/listPallindrome.cpp)|
26
26
| Insert data in a sorted linked list.|[insertInASortedLinkedList.cpp](linked_list_problems/insertInASortedLinkedList.cpp)|
0 commit comments