Jul 17

Author: siddydutta

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

@@ -0,0 +1,24 @@
+class Solution:
+    def maximumLength(self, nums: list[int], k: int) -> int:
+        dp = [[0] * k for _ in range(k)]
+        result = 0
+        for num in nums:
+            num %= k
+            for prev in range(k):
+                dp[prev][num] = dp[num][prev] + 1
+                result = max(result, dp[prev][num])
+        return result
+
+
+def main():
+    nums = [1, 2, 3, 4, 5]
+    k = 2
+    assert Solution().maximumLength(nums, k) == 5
+
+    nums = [1, 4, 2, 3, 1, 4]
+    k = 3
+    assert Solution().maximumLength(nums, k) == 4
+
+
+if __name__ == '__main__':
+    main()

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

@@ -20,7 +20,7 @@
 | 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 | [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 17 | [3202. Find the Maximum Length of Valid Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/) | Medium | Unsolved |
 | July 18 | []() |  |  |
 | July 19 | []() |  |  |
 | July 20 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 5 | 5 | 0 |
-| Medium | 6 | 6 | 0 |
+| Medium | 7 | 6 | 1 |
 | Hard   | 5 | 1 | 4 |