diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp
index f9bd14095..6b721295d 100644
--- a/data_structures/reverse_a_linked_list.cpp
+++ b/data_structures/reverse_a_linked_list.cpp
@@ -18,6 +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.
+<<<<<<< HEAD
 <<<<<<< HEAD
  * Graphic
  * Explanation:https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing
@@ -25,6 +26,10 @@
  * [A graphic explanation and view of what's happening behind the
  scenes](https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing)
 >>>>>>> 3635d1b7257e1909d9ee82b1ebecd83af8870d6e
+=======
+ * [A graphic explanation and view of what's happening behind the
+ scenes](https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing)
+>>>>>>> 25e0fa925bdc9bda0cb2ca5909137e954d49d3a3
  *
  */
 #include <cassert>   /// for assert