find the kth largest node in a linked list in csharp

main.cs
public ListNode FindKthLargestNode(ListNode head, int k) {
    ListNode lead = head;
    ListNode follower = head;

    // Move the lead pointer k nodes ahead of the follower
    for (int i = 0; i < k; i++) {
        if (lead == null) {
            throw new ArgumentException("Linked list has less than k nodes");
        }
        lead = lead.Next;
    }

    // Move both pointers until the lead pointer reaches the end of the list
    while (lead != null) {
        lead = lead.Next;
        follower = follower.Next;
    }

    return follower;
}
552 chars
21 lines

main.cs
ListNode head = new ListNode(1);
head.Next = new ListNode(3);
head.Next.Next = new ListNode(2);
head.Next.Next.Next = new ListNode(5);
head.Next.Next.Next.Next = new ListNode(4);

ListNode kthLargest = FindKthLargestNode(head, 3);
Console.WriteLine(kthLargest.Value); // Outputs 3
281 chars
9 lines