/*

​

​

Good afternoon! Here's your coding interview problem for today.

​

Given a singly linked list and an integer k, remove the kth last element from the list. k is guaranteed to be smaller than the length of the list.

​

The list is very long, so making more than one pass is prohibitively expensive.

​

Do this in constant space and in one pass.

​

​

*/

​

​

using System;

using System.Collections.Generic;       

public class Program

{

    public static void Main()

    {

        int k = 0;

        int[] numbers = { 80,74,6,44,5,34,95,38,73,63,2,37,91,45,70,24,17,57,79,96,22,30,59,49,28,11,15,42,84,8,92,71,16,54,1,56,77,21,60,48,81,97,18,94,68,4,72,86,14,64,46,66,69,31,12,47,33,25,53,52,82,23,32,88,51,67,27,43,26,89,41,7,90,40,36,61,75,9,62,83,65,35,87,50,13,58,93,10,20,3,100,39,85,19,55,98,99,76,29,78 };

        LinkedList<int> numList = new LinkedList<int>(numbers);

        RemoveKthFromEnd(numList, k);

    }

    public static void RemoveKthFromEnd(LinkedList<int> numbers, int k)

    {

    } 

}