From 123d6640bbaeb62b4917fe7638f3d2c46919cef2 Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Mon, 6 Sep 2021 18:30:32 +0000
Subject: [PATCH] clang-format and clang-tidy fixes for 19b4a937

---
 data_structures/reverse_a_linked_list.cpp | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp
index 5385a7ec0..38e50e5f1 100644
--- a/data_structures/reverse_a_linked_list.cpp
+++ b/data_structures/reverse_a_linked_list.cpp
@@ -9,11 +9,11 @@
  * the pointers) starting from the first link. Whichever link points to null
  * is considered the last link and is pointed to the new value.
  *
- * Linked List can be reversed by using 3 pointers: current, previous, and next_node;
- * we keep iterating until the last node. Meanwhile, before changing to the next
- * of current, we store it in the next_node pointer, now we store the prev
- * pointer in the current of next, this is where the actual reversal happens.
- * And then we move the prev and current pointers one step forward.
+ * Linked List can be reversed by using 3 pointers: current, previous, and
+ * next_node; we keep iterating until the last node. Meanwhile, before changing
+ * to the next of current, we store it in the next_node pointer, now we store
+ * the prev pointer in the current of next, this is where the actual reversal
+ * 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.
  */