Insert an element at kth position from the end of linked list. Return true if success and if list is not long enough, then return -1. Take a pointer of head and then advance it by K steps forward, then take another pointer and then advance both simultaneously, so that when the first pointer reaches the end of a linked list then second pointer is at the point where you need to insert the node.

//Sorts a given list by selection sort //Input: An array A[ 0..n-1] of orderable elements. //Output: List A[0..n-1] sorted in ascending order Algorithm SelectionSort (A[ 0..n-1]) for i= 0 to n - 2 do min = i for j= i + 1 to n - 1 do if A[j] A[min] min = j swap A[i] and A[min]