Remove Nth Node From End of List

Problem statement

Given the head of a linked list, remove the nth node from the end of the list and return its head.

Example 1:

Input: head = [1,2,3,4,5], n = 2Output: [1,2,3,5]

Example 2:

Input: head = [1], n = 1Output: []

Example 3:

Input: head = [1,2], n = 1Output: [1]

Constraints:

• The number of nodes in the list is sz.
• 1 <= sz <= 30
• 0 <= Node.val <= 100
• 1 <= n <= sz

Follow up: Could you do this in one pass?

My solution

/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @param {number} n
 * @return {ListNode}
 */
var removeNthFromEnd = function(head, n) {
    let count = 0;
    
    let node = head;
    
    while(node) {
        count++;
        node = node.next
    }
    
    const nodeToDelete = count - n;
    
    node = head;
    let prev = null;
    count = 0
    
    while(node) {
        if (count === nodeToDelete) {
            if (prev) {
                prev.next = node.next
            } else {
                head = node.next;
            }
            break;
        }
        
        prev = node;
        node = node.next
        count++
        
    }
    
    return head;
};