title: Remove Kth Linked List Node
body: <p><strong>QUESTION</strong></p>
  <blockquote>
  <p>Write a function that receives as input the head node of a linked list an integer <code>k</code>.</p>
  <p>Your function should remove the kth node from the end of the linked list and return the head node of the updated list.</p>
  </blockquote>
  <p><strong>EXAMPLE LINKED LIST</strong></p>
  <p>(20) -&gt; (19) -&gt; (18) -&gt; (17) -&gt; (16) -&gt; (15) -&gt; (14) -&gt; (13) -&gt; (12) -&gt; (11) -&gt; null</p>
  <p>Head node would refer to the node (20). Let <code>k</code> = 4, so it should remove the 4th node of the list, node (14).</p>
  <p>The new list should have node (14) removed from it.</p>
  <p><strong>CODE</strong></p>
  <pre><code>const linkedList = node =&gt; {
  
  let head = node;
  
  
  }
  </code></pre>
  <p>I'm not sure how to go about this. I define a function with node as a parameter and I need to be able to differentiate each node and be able to traverse through and remove the one in question.</p>
  <p>Any starter tips or pointers?</p>