From db8e74a9045ca098be79bec78f976fdadb4ddff2 Mon Sep 17 00:00:00 2001 From: Tisha Soumya Date: Sun, 12 Sep 2021 23:11:39 +0530 Subject: [PATCH] docs: fix changes Co-authored-by: David Leal --- data_structures/reverse_a_linked_list.cpp | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index b433b76dd..0ed7ba3e1 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -18,8 +18,7 @@ * happens. And then we move the prev and current pointers one step forward. * Then the head node is made to point to the last node (prev pointer) after * completion of an iteration. - * Graphic - * Explanation:https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing + * [A graphic explanation and view of what's happening behind the scenes](https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing) * */ #include /// for assert