(Algorithms in Javascript) CTCI 2.3 - Delete Middle Node: Implement an algorithm to delete a node in the middle (i.e., any node but the first and last node, not necessarily the exact middle) of a singly linked list, given only access to that node.

ctci-2.3-delete-middle-node.js

const removeElements = (head, val) => {
  if(head === null) return head;
  let current = head;
  while(current.next !== null && current.val === val) {
    current = current.next;
  }    
  if(!current.next && current.val === val) return [];
  head = current;
  while(current.next !== null) {
    if(current.next.val === val) {
      current.next = current.next.next;
    } else {
      current = current.next;
    }
  } 
  return head;
};