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
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -18,7 +18,7 @@
18
18
| Swap nodes of a linkedlist without swapping data. |[swapNodesWithoutSwappingData.cpp](linked_list_problems/swapNodesWithoutSwappingData.cpp)|
19
19
| Reverse a linked list, iteratively and recursively |[reverseLinkedListIterAndRecurse.cpp](linked_list_problems/reverseLinkedListIterAndRecurse.cpp)|
20
20
| Given a linked list, reverse alternate nodes and append at the end. |[reverseAlternateNodes.cpp](linked_list_problems/reverseAlternateNodes.cpp)|
21
-
| Only given a node pointer, delete the node from the linked list. |[deleteNode.cpp](linked_list_problems/deleteNode.cpp)|
21
+
| Only given a node pointer, delete the node from the linked list. |[deleteNode.cpp](linked_list_problems/deleteNode.cpp)|
22
22
| Delete the entire linkedlist. |[deleteLinkedlist.cpp](linked_list_problems/deleteLinkedlist.cpp)|
23
23
| 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)|
24
24
| Determine if a linked list is a pallindrome. |[listPallindrome.cpp](linked_list_problems/listPallindrome.cpp)|
@@ -33,7 +33,7 @@
33
33
### Include
34
34
Include contains single header implementation of data structures and some algorithms.
35
35
36
-
|DS/ALG| Implementation |
36
+
|Data Structure/Algorithm| Implementation |
37
37
| :------------: | :----------: |
38
38
| Generic Macros and Algorithms like swap, random number generation |[generic.h](include/generic.h)|
0 commit comments