Jul 16

Author: siddydutta

2025-07-July-LeetCoding-Challenge/Find the Maximum Length of Valid Subsequence I.py

@@ -0,0 +1,30 @@
+class Solution:
+    def maximumLength(self, nums: list[int]) -> int:
+        n_evens, n_odds = 0, 0
+        for num in nums:
+            if num & 1 == 0:
+                n_evens += 1
+            else:
+                n_odds += 1
+
+        n_alts, parity = 1, nums[0] & 1
+        for num in nums[1:]:
+            if num & 1 != parity:
+                n_alts += 1
+                parity = num & 1
+        return max(n_evens, n_odds, n_alts)
+
+
+def main():
+    nums = [1, 2, 3, 4]
+    assert Solution().maximumLength(nums) == 4
+
+    nums = [1, 2, 1, 1, 2, 1, 2]
+    assert Solution().maximumLength(nums) == 6
+
+    nums = [1, 3]
+    assert Solution().maximumLength(nums) == 2
+
+
+if __name__ == '__main__':
+    main()

2025-07-July-LeetCoding-Challenge/README.md

@@ -19,7 +19,7 @@
 | July 13 | [2410. Maximum Matching of Players With Trainers](https://leetcode.com/problems/maximum-matching-of-players-with-trainers/) | Medium | Solved |
 | July 14 | [1290. Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | Easy | Solved |
 | July 15 | [3136. Valid Word](https://leetcode.com/problems/valid-word/) | Easy | Solved |
-| July 16 | []() |  |  |
+| July 16 | [3201. Find the Maximum Length of Valid Subsequence I](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-i/) | Medium | Solved |
 | July 17 | []() |  |  |
 | July 18 | []() |  |  |
 | July 19 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 5 | 5 | 0 |
+| Medium | 6 | 6 | 0 |
 | Hard   | 5 | 1 | 4 |