@@ -1,4 +1,3 @@
-+ linked list
 + double linked list
 + is palindrome
 + sqap nodes
@@ -0,0 +1,72 @@
+const node = require('./Node');
+let Node = node.Node;
+
+class LinkedList {
+    constructor() {
+        this.head = null;
+    }
+
+    append(data) {
+        if (this.head === null) {
+            this.head = new Node(data);
+            return;
+        }
+
+        let currentNode = this.head;
+
+        while (currentNode.next !== null) {
+            currentNode = currentNode.next;
+        }
+
+        currentNode.next = new Node(data);
+    }
+
+    prepend(data) {
+        const newHead = new Node(data);
+        newHead.next = this.head;
+        this.head = newHead;
+    }
+
+    deleteWithValue(key, value) {
+        if (this.head === null) return false;
+
+        if (this.head.data[key] === value) {
+            this.head = this.head.next;
+            return true;
+        }
+
+        let currentNode = this.head;
+
+        while (currentNode.next !== null) {
+            if (currentNode.next.data[key] === value) {
+                currentNode.next = currentNode.next.next;
+                return true;
+            }
+            currentNode = currentNode.next;
+        }
+
+        return false;
+    }
+
+    getNodeWithValue(key, value) {
+        if (this.head === null) return null;
+
+        let currentNode = this.head;
+
+        if (this.head.data[key] === value) {
+            return this.head;
+        }
+
+        while (currentNode !== null) {
+            if (currentNode.data[key] === value) {
+                return currentNode;
+            }
+
+            currentNode = currentNode.next;
+        }
+
+        return null;
+    }
+}
+
+module.exports = {LinkedList: LinkedList}
@@ -0,0 +1,97 @@
+const linked = require('./LinkedList');
+const node = require('./Node');
+let LinkedList = linked.LinkedList;
+let Node = node.Node;
+
+test('we can create a new linked list', () => {
+    const ll = new LinkedList();
+    expect(ll).toBeDefined();
+    expect(ll).toHaveProperty('head');
+});
+
+test('we can create a new node', () => {
+    const ll = new LinkedList();
+    const data = {'repoName': 'JavaScriptAlgorithms', 'owner': 'vJechsmayr'};
+    const node = new Node(data);
+
+    expect(ll).toBeDefined();
+    expect(node.data).toEqual(data);
+});
+
+test('we can append to the linked list', () => {
+    const ll = new LinkedList();
+    const data = {'repoName': 'JavaScriptAlgorithms', 'owner': 'vJechsmayr'};
+    const node = new Node(data);
+    ll.append(data);
+    expect(ll.head).toEqual(node);
+});
+
+test('we can prepend to the linked list', () => {
+    const ll = new LinkedList();
+    const firstData = {'repoName': 'JavaScriptAlgorithms', 'owner': 'vJechsmayr'};
+    const secondData = {'repoName': 'jest', 'owner': 'facebook'};
+    const firstNode = new Node(firstData);
+    const secondNode = new Node(secondData);
+
+    ll.append(firstData);
+    ll.prepend(secondData);
+    secondNode.next = firstNode;
+
+    expect(ll.head).toEqual(secondNode)
+});
+
+test('we can delete from the linked list', () => {
+    const ll = new LinkedList();
+
+    const firstData = {'repoName': 'JavaScriptAlgorithms', 'owner': 'vJechsmayr'};
+    const firstNode = new Node(firstData);
+
+    ll.append(firstData);
+    expect(ll.head).toEqual(firstNode);
+
+    ll.deleteWithValue('repoName', 'JavaScriptAlgorithms');
+
+    expect(ll.head).toEqual(null);
+});
+
+test('we receive false when trying to delete from an empty linked list', () => {
+    const ll = new LinkedList();
+    expect (ll.deleteWithValue('repoName', 'nothing')).toBe(false);
+});
+
+test('we receive true when trying to delete from an empty linked list', () => {
+    const ll = new LinkedList();
+    const firstData = {'repoName': 'JavaScriptAlgorithms', 'owner': 'vJechsmayr'};
+
+    ll.append(firstData);
+
+    expect (ll.deleteWithValue('repoName', 'JavaScriptAlgorithms')).toBe(true);
+});
+
+test('we can retrieve a node from the linked list', () => {
+    const ll = new LinkedList();
+
+    const firstData = {'repoName': 'JavaScriptAlgorithms', 'owner': 'vJechsmayr'};
+    const secondData = {'repoName': 'jest', 'owner': 'facebook'};
+    const secondNode = new Node(secondData);
+
+    ll.append(firstData);
+    ll.append(secondData);
+
+    const fb = ll.getNodeWithValue('owner', 'facebook');
+
+    expect(fb).toEqual(secondNode);
+});
+
+test('we receive null when retreiving a non-existant node', () => {
+    const ll = new LinkedList();
+
+    const firstData = {'repoName': 'JavaScriptAlgorithms', 'owner': 'vJechsmayr'};
+    const firstNode = new Node(firstData);
+
+    ll.append(firstData);
+
+    const search = ll.getNodeWithValue('repoName', 'nothing');
+
+    expect(search).toBe(null);
+});
@@ -0,0 +1,8 @@
+class Node {
+    constructor (data) {
+        this.data = data;
+        this.next = null;
+    }
+}
+
+module.exports = {Node: Node}