Company: ibm_23oct
Difficulty: medium
Question 2 Problem Description Given a linked list of integers, return a reference to the head of a similar linked list with all odd values removed. Input Format for Custom Testing: The first line contains an integer n, the number of nodes in the list. Each of the next n lines contains an integer node->data. Examples Example 1: Input: Linked list = [2, 1, 3, 4, 6] Output: [2, 4, 6] Explanation: The original linked list values are 2 → 1 → 3 → 4 → 6. After removing odd values (1 and 3), the new linked list is 2 → 4 → 6. Constraints 1 ≤ n ≤ 10 5 1 ≤ Linked list node values ≤ 10 5