Delete a doubly linked list node at a given position

Linked list is pair of nodes, each node are contain information of next upcoming nodes. Our goal is to find the node on given location X , If node are existing at given location then delete this node. Note that location X is an integer value and first node are location at 1st. Suppose we are inserted the following (11, 22, 33, 44, 55, 66, 77) node in a sequence.

Here given code implementation process.

1) Delete node at given position in a doubly linked list in java 2) Delete node at given position in a doubly linked list in c++ 3) Delete node at given position in a doubly linked list in c 4) Delete node at given position in a doubly linked list in c# 5) Delete node at given position in a doubly linked list in php 6) Delete node at given position in a doubly linked list in python 7) Delete node at given position in a doubly linked list in ruby 8) Delete node at given position in a doubly linked list in golang 9) Delete node at given position in a doubly linked list in vb.net 10) Delete node at given position in a doubly linked list in node js 11) Delete node at given position in a doubly linked list in typescript 12) Delete node at given position in a doubly linked list in scala 13) Delete node at given position in a doubly linked list in swift 14) Delete node at given position in a doubly linked list in kotlin