C Program:

Input: n and k Output: The position number who will survive. Requirement: You must use the concept of circular queue while inserting and it should be implemented using circular doubly linked list. You don't need to use front and rear as you are using linked list. Root and last node automatically handle that. Hint: After getting the value of n, generate n numbers (1, 2, 3., ..., n) and insert into the doubly circular linked list. Then start deleting nodes based on the value of k until the list has only one node remaining