Given a linked list, you are asked to remove the last element in the list thatβs equal to X. In case the linked list does not contain X, the link list should stay untouched.
Input
The initial data for the linked list is obtained automatically. You donβt need to do anything. Itβs guaranteed that the size of the linked list does exceed and the values in the linked list donβt exceed in their absolute value.
Output
The data of the linked list is printed automatically. You donβt need to do anything.