Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.
Input: head = [1,2,6,3,4,5,6], val = 6
Note: We don’t really need double pointers to solve this because the memory of linked lists is not really consecutive. Just using one
pointer to iterate is enough.