Today's leetcode porblem solution

Leetcode_3217.java

@@ -0,0 +1,34 @@
+class Solution {
+
+    public ListNode modifiedList(int[] nums, ListNode head) {
+        // Create a HashSet for efficient lookup of values in nums
+        Set<Integer> valuesToRemove = new HashSet<>();
+        for (int num : nums) {
+            valuesToRemove.add(num);
+        }
+
+        // Handle the case where the head node needs to be removed
+        while (head != null && valuesToRemove.contains(head.val)) {
+            head = head.next;
+        }
+
+        // If the list is empty after removing head nodes, return null
+        if (head == null) {
+            return null;
+        }
+
+        // Iterate through the list, removing nodes with values in the set
+        ListNode current = head;
+        while (current.next != null) {
+            if (valuesToRemove.contains(current.next.val)) {
+                // Skip the next node by updating the pointer
+                current.next = current.next.next;
+            } else {
+                // Move to the next node
+                current = current.next;
+            }
+        }
+
+        return head;
+    }
+}