# JavaScript Exercises: Size of a Singly Linked list

## JavaScript Singly Linked List: Exercise-12 with Solution

Write a JavaScript program that calculates the size of a Singly Linked list.

Sample Solution:

JavaScript Code:

``````class Node {
constructor(data) {
this.data = data
this.next = null
}
}
}
if(node==null){
return;
}
while (node.next) {
node = node.next;
}
node.next = newNode;
}
size(){
let count = 0;
while (current) {
count++;
current = current.next;
}
return count;
}
displayList(){
var str = ""
while (node) {
str += node.data + "->";
node = node.next;
}
str += "NULL"
console.log(str);
}
}
numList.displayList();
console.log("Size of the said list Singly Linked list:")
console.log(numList.size());
numList.displayList();
console.log(numList.size());
```
```

Sample Output:

```Singly Linked list:
12->13->14->15->14->NULL
Size of the said list Singly Linked list:
5
12->13->14->15->14->20->21->22->NULL
8
```

Flowchart:

Live Demo:

See the Pen javascript-singly-linked-list-exercise-12 by w3resource (@w3resource) on CodePen.

Improve this sample solution and post your code through Disqus

Singly Linked List Previous: Remove a node at the specified index in a singly linked list.
Singly Linked List Next: Remove the first element from a Singly Linked list.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿

## JavaScript: Tips of the Day

Shorten an array using its length property

A great way of shortening an array is by redefining its length property.

```let array = [0, 1, 2, 3, 4, 5, 6, 6, 8, 9]
array.length = 4
// Result: [0, 1, 2, 3]
```

Important to know though is that this is a destructive way of changing the array. This means you lose all the other values that used to be in the array.

Ref: https://bit.ly/2LBj213