# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#203. Remove Linked List Elements
#Remove all elements from a linked list of integers that have value val.
#Example
#Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
#Return: 1 --> 2 --> 3 --> 4 --> 5
#Credits:
#Special thanks to @mithmatt for adding this problem and creating all test cases.
## Definition for singly-linked list.
## class ListNode
##     attr_accessor :val, :next
##     def initialize(val)
##         @val = val
##         @next = nil
##     end
## end
## @param {ListNode} head
## @param {Integer} val
## @return {ListNode}
#def remove_elements(head, val)
#end



# Time Is Money