Find the kth node from beginning of linked list . We also find previous of kth node because we need to update next pointer of the previous .
x = head ; x_prev = null ; for ( i = 1 ; i < k ; i ++ ) { x_prev = x ; x = x . next ; }