Algorithm

The most straightforward way to look at this problem is to delete the kth node from the beginning and point the previous node, (k-1)th node, to the next node, (k+1)th node, to complete the modification of linked list.

There are some edge cases which we will have to consider. If the value of K is one, that means we simply have to delete the head of the linked list whereas if the value of K is equal to length of linked list then we have to delete the tail of the linked list.

Initialize a temporary pointer to the head of the list and a previous pointer prev. The temporary pointer will be used to traverse the list till the kth node, and the previous pointer will keep track of the previous node that the temporary pointer is pointing to.
Initialize a counter which will be used to keep track of the number of nodes traversed. Once counter equals k, this means we have reached the kth node
When counter reaches K, the temporary pointer is at the node that is to be deleted.
Link the previous node to the next node of temporary pointer node and delete the temporary node to free space