Please enter your email address or userHandle.
Given a doubly linked list and a position. The task is to delete a node from given position in a doubly linked list.
LinkedList = 1 <--> 3 <--> 4
x = 3
Output: 1 3
Explanation: After deleting the node at
position 3 (position starts from 1),
the linked list will be now as 1->3.
LinkedList = 1 <--> 5 <--> 2 <--> 9
x = 1
Output: 5 2 9
The task is to complete the function deleteNode() which should delete the node at given position and return the head of the linkedlist.
Expected Time Complexity : O(N)
Expected Auxilliary Space : O(1)
2 <= size of the linked list <= 1000
1 <= x <= N
We strongly recommend solving this problem on your own before viewing its editorial. Do you still
want to view the editorial?
Login to access your submissions.