Linked List Walker presented by Easy LeetCode

function walkLinkedList<T>(
  head: T,
  getNextNode: (node: T) => T | null,
  visit: (node: T, index: number) => void
): void {
  let cursor: T | null = head;
  let index = 0;

  while (cursor !== null) {
    visit(cursor, index);
    cursor = getNextNode(cursor);
    index++;
  }
}

Use Linked List Walker on LeetCode

Copy this snippet and paste it to the bottom of your LeetCode editor so that you can use the Linked List Walker.

Don’t use it where the problem itself is to implement a Linked List Walker.