D. J.:

- Added the leetcode problem and solution for 3202

Author: nobodyPerfecZ

README.md

@@ -273,6 +273,7 @@
 - [2523 Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/description/)
 - [2799 Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/description/)
 - [3136 Valid Word](https://leetcode.com/problems/valid-word/description/)
+- [3202 Find the Maximum Length of Valid Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/description/)
 - [3392 Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/description/)
 
 ## Development 🔧

awesome_python_leetcode/_3202_find_the_maximum_length_of_valid_subsequence_II.py

@@ -0,0 +1,23 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def maximumLength(self, nums: List[int], k: int) -> int:
+        """
+        You are given an integer array nums and a positive integer k.
+        A subsequence sub of nums with length x is called valid if it satisfies:
+        - (sub[0] + sub[1]) % k == (sub[1] + sub[2]) % k == ... ==
+        (sub[x - 2] + sub[x - 1]) % k.
+
+        Return the length of the longest valid subsequence of nums.
+        """
+        dp = [[0] * k for _ in range(k)]
+        res = 0
+        for num in nums:
+            num %= k
+            for prev in range(k):
+                dp[prev][num] = dp[num][prev] + 1
+                res = max(res, dp[prev][num])
+        return res

tests/test_3202_find_the_maximum_length_of_valid_subsequence_II.py

@@ -0,0 +1,20 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._3202_find_the_maximum_length_of_valid_subsequence_II import (  # noqa: E501
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "k", "expected"],
+    argvalues=[
+        ([1, 2, 3, 4, 5], 2, 5),
+        ([1, 4, 2, 3, 1, 4], 3, 4),
+    ],
+)
+def test_func(nums: List[int], k: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    two_sum = Solution().maximumLength(nums, k)
+    assert two_sum == expected