A linked list of length atmost 'n' is maintained in a c

A linked list of length atmost 'n' is maintained in a circular array C[0..n-1] ,clockwise or anticlockwise, 2 variables "head" and "last" are used to 1st and last element of the list respectively , for instance if linked list is of size x and if it is maintained in clockwise manner and head=p , then last=(p+x)mod n,then the best way for 

  1. deleting kth element in linked 

 2.reversing the elements of the linked list can be done respectively in ?

Pritam Prasun @pritam 15 Jan 2016 12:32 am

@arvind.rawat, @ranita, Can you please help me solving this ?