diff --git a/curriculum/challenges/arabic/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.arabic.md b/curriculum/challenges/arabic/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.arabic.md index b058337256..e8e5337571 100644 --- a/curriculum/challenges/arabic/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.arabic.md +++ b/curriculum/challenges/arabic/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.arabic.md @@ -53,18 +53,17 @@ function LinkedList() { this.add = function(element){ var node = new Node(element); - if(head === null){ + if (head === null){ head = node; } else { - var currentNode = head; + var currentNode = head; - while(currentNode.next){ - currentNode = currentNode.next; - } + while (currentNode.next) { + currentNode = currentNode.next; + } - currentNode.next = node; + currentNode.next = node; } - length++; }; @@ -73,7 +72,6 @@ function LinkedList() { // Only change code above this line } - ``` diff --git a/curriculum/challenges/chinese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.chinese.md b/curriculum/challenges/chinese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.chinese.md index 88449a6f17..ed098b2f99 100644 --- a/curriculum/challenges/chinese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.chinese.md +++ b/curriculum/challenges/chinese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.chinese.md @@ -54,18 +54,17 @@ function LinkedList() { this.add = function(element){ var node = new Node(element); - if(head === null){ + if (head === null){ head = node; } else { - var currentNode = head; + var currentNode = head; - while(currentNode.next){ - currentNode = currentNode.next; - } + while (currentNode.next) { + currentNode = currentNode.next; + } - currentNode.next = node; + currentNode.next = node; } - length++; }; 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 93d842ea8f..2d843ecaea 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 @@ -61,18 +61,17 @@ function LinkedList() { this.add = function(element){ var node = new Node(element); - if(head === null){ + if (head === null){ head = node; } else { - var currentNode = head; + var currentNode = head; - while(currentNode.next){ - currentNode = currentNode.next; - } + while (currentNode.next) { + currentNode = currentNode.next; + } - currentNode.next = node; + currentNode.next = node; } - length++; }; diff --git a/curriculum/challenges/portuguese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.portuguese.md b/curriculum/challenges/portuguese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.portuguese.md index 3190d16f34..cf97082444 100644 --- a/curriculum/challenges/portuguese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.portuguese.md +++ b/curriculum/challenges/portuguese/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.portuguese.md @@ -54,18 +54,17 @@ function LinkedList() { this.add = function(element){ var node = new Node(element); - if(head === null){ + if (head === null){ head = node; } else { - var currentNode = head; + var currentNode = head; - while(currentNode.next){ - currentNode = currentNode.next; - } + while (currentNode.next) { + currentNode = currentNode.next; + } - currentNode.next = node; + currentNode.next = node; } - length++; }; diff --git a/curriculum/challenges/russian/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.russian.md b/curriculum/challenges/russian/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.russian.md index 102bda3dac..dafe0a6ff5 100644 --- a/curriculum/challenges/russian/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.russian.md +++ b/curriculum/challenges/russian/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.russian.md @@ -54,18 +54,17 @@ function LinkedList() { this.add = function(element){ var node = new Node(element); - if(head === null){ + if (head === null){ head = node; } else { - var currentNode = head; + var currentNode = head; - while(currentNode.next){ - currentNode = currentNode.next; - } + while (currentNode.next) { + currentNode = currentNode.next; + } - currentNode.next = node; + currentNode.next = node; } - length++; }; diff --git a/curriculum/challenges/spanish/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.spanish.md b/curriculum/challenges/spanish/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.spanish.md index dc33289708..dfe48b4fae 100644 --- a/curriculum/challenges/spanish/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.spanish.md +++ b/curriculum/challenges/spanish/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.spanish.md @@ -54,18 +54,17 @@ function LinkedList() { this.add = function(element){ var node = new Node(element); - if(head === null){ + if (head === null){ head = node; } else { - var currentNode = head; + var currentNode = head; - while(currentNode.next){ - currentNode = currentNode.next; - } + while (currentNode.next) { + currentNode = currentNode.next; + } - currentNode.next = node; + currentNode.next = node; } - length++; };