Given a doubly linked list and a key, delete all occurrences of the given\u00a0key from the doubly linked list.<\/p>\n\n\n\n
Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n Example1:<\/strong><\/p>\n\n\n\n Example2:<\/strong><\/p>\n\n\n\n Your Task:<\/strong><\/p>\n\n\n\n Complete the function void deleteAllOccurOfX(struct Node** head_ref, int key)<\/strong>, which takes the reference of the head pointer and an integer value key. Delete all occurrences of the key from the given DLL.<\/p>\n\n\n\n Expected Time Complexity:<\/strong>\u00a0O(N). Constraints:<\/strong><\/p>\n\n\n\n Think of this like removing all instances of a specific word from a sentence written on sticky notes connected to each other! Since it’s a doubly linked list, each note (node) is connected to both its previous and next notes. When we find a note with the word we want to remove, we need to carefully disconnect it and reconnect its neighbors to each other. We also need to be careful about updating the head if we’re removing the first note.<\/p>\n\n\n\nInput:<\/strong>
2<->2<->10<->8<->4<->2<->5<->2
2
Output:<\/strong>
10<->8<->4<->5
Explanation: <\/strong>
All Occurences of 2 have been deleted.<\/pre>\n\n\n\nInput:<\/strong> \n9<->1<->3<->4<->5<->1<->8<->4\n9\nOutput:<\/strong> \n1<->3<->4<->5<->1<->8<->4\nExplanation: <\/strong>\nAll Occurences of 9 have been deleted.<\/pre>\n\n\n\n
Expected Auxiliary Space:<\/strong>\u00a0O(1).<\/p>\n\n\n\n\n
\n\n\n\nSolution: Traversal and Deletion Approach<\/h2>\n\n\n\n
Intuition<\/h3>\n\n\n\n
Detailed Approach<\/h3>\n\n\n\n
\n
Code<\/h3>\n\n\n\n