Delete the Node at an Index
Remove the node at position index (the head is index 0) and return the head. If the list has no node at that index, return it unchanged. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [10,20,30]
index 1
returns [10,30]
The 20 is removed.
Example 2
head [10,20,30]
index 3
returns [10,20,30]
Index 3 does not exist.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 1000 <= index <= 200
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.