[LeetCode] 203. Remove Linked List Elements

Problem : https://leetcode.com/problems/remove-linked-list-elements/

Remove element recursively.

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def removeElements(self, head: ListNode, val: int) -> ListNode:
        if not head:
            return head
        
        if head.val == val:
            # remove element with the target val
            return self.removeElements(head.next, val)
        
        head.next = self.removeElements(head.next, val)
        
        return head