Code formatting and README update

Author: github-actions[bot]

README.md

@@ -253,6 +253,7 @@ This project contains the following subfolders (up to 3 levels deep):
 | leetcode | Easy | [1957-delete-characters-to-make-fancy-string](./leetcode/Easy/1957-delete-characters-to-make-fancy-string/) | Python | 2024-11-01 |
 | leetcode | Easy | [0350-intersection-of-two-arrays-ii](./leetcode/Easy/0350-intersection-of-two-arrays-ii/) | Python | 2024-07-02 |
 | leetcode | Easy | [1716-calculate-money-in-leetcode-bank](./leetcode/Easy/1716-calculate-money-in-leetcode-bank/) | Python | 2023-12-12 |
+| leetcode | Easy | [3318-find-x-sum-of-all-k-long-subarrays-i](./leetcode/Easy/3318-find-x-sum-of-all-k-long-subarrays-i/) | Python | 2025-11-04 |
 | leetcode | Easy | [0463-island-perimeter](./leetcode/Easy/0463-island-perimeter/) | Python | 2024-04-18 |
 | leetcode | Easy | [0704-binary-search](./leetcode/Easy/0704-binary-search/) | Python | 2024-09-14 |
 | leetcode | Easy | [1351-count-negative-numbers-in-a-sorted-matrix](./leetcode/Easy/1351-count-negative-numbers-in-a-sorted-matrix/) | Python | 2024-09-14 |

algorithms.json

@@ -1991,6 +1991,14 @@
     "last_commit_date": "2023-12-12",
     "slug": "leetcode/Easy/1716-calculate-money-in-leetcode-bank"
   },
+  {
+    "platform": "leetcode",
+    "difficulty": "Easy",
+    "problem_name": "3318-find-x-sum-of-all-k-long-subarrays-i",
+    "languages": "Python",
+    "last_commit_date": "2025-11-04",
+    "slug": "leetcode/Easy/3318-find-x-sum-of-all-k-long-subarrays-i"
+  },
   {
     "platform": "leetcode",
     "difficulty": "Easy",

leetcode/Easy/3318-find-x-sum-of-all-k-long-subarrays-i/3318-find-x-sum-of-all-k-long-subarrays-i.py

@@ -2,9 +2,9 @@ class Solution:
     def findXSum(self, nums: List[int], k: int, x: int) -> List[int]:
         n = len(nums)
         ans = []
-        for i in range(n-k+1):
-            cnt = Counter(nums[i:i+k])
-            freq = sorted(cnt.items(), key=lambda v : (-v[1], -v[0]))
-            xsum = sum(k*v for k, v in freq[:x])
+        for i in range(n - k + 1):
+            cnt = Counter(nums[i : i + k])
+            freq = sorted(cnt.items(), key=lambda v: (-v[1], -v[0]))
+            xsum = sum(k * v for k, v in freq[:x])
             ans.append(xsum)
-        return ans
+        return ans