


Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
The following images depict how the deletion has been performed.


The first line contains the elements of the linked list separated by a single space.
The second line contains the integer value of 'POS'. It denotes the position in the linked list from where the node has to be deleted.
While specifying the list elements for input, -1 indicates the end of the singly linked list and hence, would never be a list element
Print the resulting linked list of integers in a row, separated by a single space.
You are not required to print the output, it has already been taken care of. Just implement the function.
Maximum Island Size in a Binary Tree
Equal Subtree Sums
Sorted Doubly Linked List to Balanced BST
Longest Substring with K-Repeating Characters
Expression Add Operators