LeetCode 3201 Find the Maximum Length of Valid Subsequence I(Med, Java, O(n))

Problem Statement LeetCode 3201: Find the Maximum Length of Valid Subsequence I Given an array of integers nums, find the maximum length of a valid subsequence. A valid subsequence is defined as one where all elements have the same parity (all even...