Linked List implementation and find nth value in JS

MIT.LICENSE

@@ -0,0 +1,20 @@
+Copyright (c) 2008-2014 Pivotal Labs
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

linked_list/00-implement.js

@@ -0,0 +1,49 @@
+'use strict';
+
+class LinkedListNode{
+  constructor(val){
+    this._value = val;
+  }
+  get value() {
+    return this._value; 
+  }
+  set value(val) {
+    this._value = val; 
+  }
+  get next(){
+    return this._next;
+  }
+  set next(nxt){
+    this._next = nxt;
+  }
+}
+
+class LinkedList {
+  constructor(){
+    this.sentinel = new LinkedListNode(null);
+  }
+  get head(){
+    return this.sentinel.next;
+  }
+  insert(val) {
+    var node = new LinkedListNode(val);
+    node.next = this.sentinel.next;
+    this.sentinel.next = node;
+  }
+  delete(){
+    if(this.sentinel.next){
+      this.sentinel.next=this.sentinel.next.next;
+    }
+  }
+}
+
+
+// var ll = new LinkedList();
+// ll.insert(1);
+// console.log(ll);
+// ll.insert(2);
+// console.log(ll);
+// ll.insert(2);
+
+
+module.exports.LinkedList = LinkedList;

linked_list/01-find-nth-node-value.js

@@ -0,0 +1,17 @@
+// Write a function that takes 2 arguments; a linked list (ll) and on integer(n).
+// The function should return the value of the nth node in the linked list.
+// 
+// Assume that the linked is in non-empty and is of length at least 'n'
+
+var ll = require('./00-implement');
+
+function valueOfNthNode(ll, n){
+  var currentNode = ll.head;
+  for(var i=0;i<n-1;i++){
+    currentNode = currentNode.next
+  }
+  return currentNode.value
+}
+
+
+module.exports.valueOfNthNode = valueOfNthNode;