We have discussed**[Linked List Introduction](https://github.com/Dentrax/Data-Structures-with-Go/tree/master/linked-list-1-introduction)**and**[Linked List Insertion](https://github.com/Dentrax/Data-Structures-with-Go/tree/master/linked-list-2-inserting-a-node)**in previous posts on singly linked list.
Let us formulate the problem statement to understand the deletion process.Given a `key`, delete the first occurrence of this key in linked list.