solution suggestion, Challenge: Remove Elements from a Linked List by Index

Contributors
1

What is your hint or solution suggestion?

function LinkedList() {
  var length = 0;
  var head = null;

  var Node = function(element){ // {1}
    this.element = element;
    this.next = null;
  };

  this.size = function(){
    return length;
  };

  this.head = function(){
    return head;
  };

  this.add = function(element){
    var node = new Node(element);
    if(head === null){
      head = node;
    } else {
      var currentNode = head;

      while(currentNode.next){
        currentNode  = currentNode.next;
      }

      currentNode.next = node;
    }

    length++;
  };

  // Only change code below this line
    this.removeAt = function(index){
      if (index < 0 || index >= length) return null;
      let currentIndex = 0, runner = head, previousNode = null;

      if (index === 0) {
        head = null;
        length--;
        return runner.element;
      }
      while(runner.next !== null){
        currentIndex+=1;
        previousNode = runner;
        runner = runner.next;
        if (currentIndex === index){
          previousNode.next = runner.next;
          length--;
          return runner.element;
        }
      }
    }
  // Only change code above this line
}

Challenge: Remove Elements from a Linked List by Index

Link to the challenge: