Delete all nodes which are divisible by X in doubly linked list

Assume that given doubly linked list are contain N nodes of integer values. Delete each nodes in this linked list which is divisible of given Value X. Suppose that linked list containing following (6, 1, 4, 9, 5, 3, 12 ) node in a sequence.

Here given code implementation process.

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