D. J.:

- Added the leetcode problem and solution for 3318

Author: nobodyPerfecZ

README.md

@@ -307,6 +307,7 @@
 - [3005 Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/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/)
+- [3318 Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/description/)
 - [3392 Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/description/)
 - [3408 Design Task Manager](https://leetcode.com/problems/design-task-manager/description/)
 - [3446 Sort Matrix by Diagonals](https://leetcode.com/problems/sort-matrix-by-diagonals/description/)

awesome_python_leetcode/_3318_find_x_sum_of_all_k_long_subarrays_I.py

@@ -0,0 +1,54 @@
+import collections
+import heapq
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def findXSum(self, nums: List[int], k: int, x: int) -> List[int]:
+        """
+        You are given an array nums of n integers and two integers k and x.
+
+        The x-sum of an array is calculated by the following procedure:
+        - Count the occurrences of all elements in the array.
+        - Keep only the occurrences of the top x most frequent elements. If two elements
+        have the same number of occurrences, the element with the bigger value is
+        considered more frequent.
+        - Calculate the sum of the resulting array.
+
+        Note that if an array has less than x distinct elements, its x-sum is the sum of
+        the array.
+
+        Return an integer array answer of length n - k + 1 where answer[i] is the x-sum
+        of the subarray nums[i..i + k - 1].
+        """
+        count = collections.defaultdict(int)
+        prev = None
+        res = []
+        for i in range(len(nums) - k + 1):
+            # Get the sliding window
+            window = nums[i : i + k]
+
+            # Update count table
+            if i == 0:
+                # Compute count table for first time
+                for val in window[:-1]:
+                    count[val] += 1
+
+            # Remove prev from count table
+            if prev:
+                count[prev] -= 1
+            prev = window[0]
+
+            # Add newest into count table
+            count[window[-1]] += 1
+
+            # Get the top-x values with their occurences
+            top_x = heapq.nlargest(x, count.items(), key=lambda x: (x[1], x[0]))
+
+            # Compute the x-sum
+            sum_x = sum(map(lambda x: x[0] * x[1], top_x))
+            res.append(sum_x)
+
+        return res

tests/test_3318_find_x_sum_of_all_k_long_subarrays_I.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._3318_find_x_sum_of_all_k_long_subarrays_I import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "k", "x", "expected"],
+    argvalues=[
+        ([1, 1, 2, 2, 3, 4, 2, 3], 6, 2, [6, 10, 12]),
+        ([3, 8, 7, 8, 7, 5], 2, 2, [11, 15, 15, 15, 12]),
+    ],
+)
+def test_func(nums: List[int], k: int, x: int, expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    x_sums = Solution().findXSum(nums, k, x)
+    assert x_sums == expected