diff --git a/curriculum/challenges/english/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.english.md b/curriculum/challenges/english/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.english.md index ab7224ac9c..93d842ea8f 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.english.md @@ -64,7 +64,7 @@ function LinkedList() { if(head === null){ head = node; } else { - currentNode = head; + var currentNode = head; while(currentNode.next){ currentNode = currentNode.next; diff --git a/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md b/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md index 919d60bb3c..a0d25075ab 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.english.md @@ -67,7 +67,7 @@ function LinkedList() { if(head === null){ head = node; } else { - currentNode = head; + var currentNode = head; while(currentNode.next){ currentNode = currentNode.next; diff --git a/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.english.md b/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.english.md index 73b4596dbc..16e271efb9 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.english.md @@ -46,7 +46,7 @@ tests: function LinkedList() { var length = 0; var head = null; - var currentNode = null; + var Node = function(element){ this.element = element; this.next = null; @@ -65,7 +65,7 @@ function LinkedList() { if(head === null){ head = node; } else { - currentNode = head; + var currentNode = head; while(currentNode.next){ currentNode = currentNode.next; diff --git a/curriculum/challenges/english/08-coding-interview-prep/data-structures/search-within-a-linked-list.english.md b/curriculum/challenges/english/08-coding-interview-prep/data-structures/search-within-a-linked-list.english.md index a6e86d63d0..06a5eaeced 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/data-structures/search-within-a-linked-list.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/data-structures/search-within-a-linked-list.english.md @@ -64,7 +64,7 @@ function LinkedList() { if(head === null){ head = node; } else { - currentNode = head; + var currentNode = head; while(currentNode.next){ currentNode = currentNode.next;