1) remove items with val ==0 from the linked list, similar to \nhttps://leetcode.com/problems/remove-linked-list-elements/\nhttps://leetcode.com/problems/remove-element/\n2) Given boolean array of days at work, [T, F, T, T, F, F, F, T] and pto (number of PTOs one can take) - where boolean T means paid holiday and F means you can take a PTO. Find the maximum length of vacation an employee can take.\nint findMaxVacationLength(year = [F, T, F, T, F, T, F, ], pto = 2) should return 5 because if we take PTO on indices year[2] and year[4], then we can get the maximum length vacation (consecutive T\'s).\nsimilar to : https://leetcode.com/problems/max-consecutive-ones-iii/

1) remove items with val ==0 from the linked list, similar to \nhttps://leetcode.com/problems/remove-linked-list-elements/\nhttps://leetcode.com/problems/remove