the kth element can be found by k=(p+k)mod n delete it and keep the pointer of the prev to the next----it is done in O(1)
to reverse the elements the head and tail of the previous list are swapped and they are accessed in anti clockwise order this can be done in O(1) time as we know the position of head and tail