This is a complete implementation of a Singly Linked List in JavaScript using ES6 class syntax. It's built entirely from scratch without using built-in array methods, and includes all core linked list operations as well as some extra credit features.
- ✅ Append elements to the end
- ✅ Prepend elements to the start
- ✅ Get the size of the list
- ✅ Get the first (
head) and last (tail) node - ✅ Access a node by index with
at(index) - ✅ Remove the last node using
pop() - ✅ Check if a value exists in the list using
contains(value) - ✅ Find the index of a value using
find(value) - ✅ Represent the list as a string with
toString() - ✅ (Extra) Insert a node at a specific index with
insertAt(value, index) - ✅ (Extra) Remove a node at a specific index with
removeAt(index)