From eb375a601529fde1ed9f14e5aa910360c850792a Mon Sep 17 00:00:00 2001
From: Dnyanesh Nimbalkar <78072155+Dnyaneshvn@users.noreply.github.com>
Date: Tue, 8 Nov 2022 00:01:44 +0530
Subject: [PATCH] Fix spelling (#3444)

---
 .../java/com/thealgorithms/datastructures/lists/README.md     | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/main/java/com/thealgorithms/datastructures/lists/README.md b/src/main/java/com/thealgorithms/datastructures/lists/README.md
index 7030c3f82..b86db4b34 100644
--- a/src/main/java/com/thealgorithms/datastructures/lists/README.md
+++ b/src/main/java/com/thealgorithms/datastructures/lists/README.md
@@ -22,10 +22,10 @@ The `next` variable points to the next node in the data structure and value stor
 
 ### File descriptions:
 
-1. `CircleLinkedList.java` : A circular linked list where next pointer of last node points to first nide of linked list.
+1. `CircleLinkedList.java` : A circular linked list where next pointer of last node points to first node of linked list.
 2. `SinglyLinkedList.java` : The classic case of single links.
 3. `CountSinglyLinkedListRecursion.java`: Recursively counts the size of a list.
 4. `CreateAndDetectLoop.java` : Create and detect a loop in a linked list.
 5. `DoublyLinkedList.java` : A modification of singly linked list which has a `prev` pointer to point to the previous node.
 6. `Merge_K_SortedLinkedlist.java` : Merges K sorted linked list with mergesort (mergesort is also the most efficient sorting algorithm for linked list).
-7. `RandomNode.java` : Selects a random node from given linked list and diplays it.
\ No newline at end of file
+7. `RandomNode.java` : Selects a random node from given linked list and diplays it.