Update README.md

challenge_8/README.md

@@ -4,7 +4,7 @@ Idea
 ------
 You are given a  linked list, nothing unusual about that right? The kicker is that aside from the normal "next" attribute each node has, they also have a "random" attribute. The "random" attribute is essentially a reference to any other node in the linked list. For example, take a look at the linked list below.
 
-![](Linkedlist.jpg) 
+![](linkedlist.jpg) 
 
 Just a normal Linked List right? Right. Nothing special about it what so ever. Now lets take a look at a linked list with random pointers.
 
@@ -24,4 +24,4 @@ Testing for this is a bit difficult.
 
 In order to test your function I would suggest manually making a linked list then setting random pointers to random nodes.
 
-Once complete, run the head of your linked list through your function and catch the new head. Essentially just make sure the random pointers point to the correct node. Perhaps compare the data values of the new list to that of the original (minus the ').
+Once complete, run the head of your linked list through your function and catch the new head. Essentially just make sure the random pointers point to the correct node. Perhaps compare the data values of the new list to that of the original (minus the ').