update readme

Author: hogan-tech

.github/test.txt

@@ -1,3 +1,4 @@
 3731-find-missing-elements python easy
 3732-maximum-product-of-three-elements-after-one-replacement python medium
-3733-minimum-time-to-complete-all-deliveries python medium
+3733-minimum-time-to-complete-all-deliveries python medium
+3318-find-x-sum-of-all-k-long-subarrays-i python easy

1700-minimum-time-to-make-rope-colorful/1700-minimum-time-to-make-rope-colorful.py

@@ -1,12 +1,12 @@
-# time complexity: O(n^2)
+# time complexity: O(n^2 * klogk)
 # space complexity: O(n)
 from typing import Counter, List
 
 
 class Solution:
     def findXSum(self, nums: List[int], k: int, x: int) -> List[int]:
         n = len(nums)
-        ans = []
+        result = []
 
         for i in range(n - k + 1):
             items = list(Counter(nums[i:i+k]).items())
@@ -16,12 +16,20 @@ def findXSum(self, nums: List[int], k: int, x: int) -> List[int]:
             for j in range(min(x, len(items))):
                 tempSum += items[j][0] * items[j][1]
 
-            ans.append(tempSum)
+            result.append(tempSum)
 
-        return ans
+        return result
 
 
-nums = [2, 5, 3, 5, 1]
+nums = [1, 1, 2, 2, 3, 4, 2, 3]
+k = 6
+x = 2
+print(Solution().findXSum(nums, k, x))
+nums = [3, 8, 7, 8, 7, 5]
 k = 2
-x = 1
+x = 2
+print(Solution().findXSum(nums, k, x))
+nums = [9, 2, 2]
+k = 3
+x = 3
 print(Solution().findXSum(nums, k, x))

1700-minimum-time-to-make-rope-colorful/README.md

@@ -66,6 +66,7 @@
 | 3217 | [Delete Nodes From Linked List Present In Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/)                                        | [Python](./Python/3217-delete-nodes-from-linked-list-present-in-array.py)                     | [Medium](./Readme/3217-delete-nodes-from-linked-list-present-in-array.md)                     |
 | 3223 | [Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations)                                                   | [Python](./Python/3223-minimum-length-of-string-after-operations.py)                          | [Medium](./Readme/3223-minimum-length-of-string-after-operations.md)                          |
 | 3227 | [Vowels Game in a String](https://leetcode.com/problems/vowels-game-in-a-string)                                                                                       | [Python](./Python/3227-vowels-game-in-a-string.py)                                            | [Medium](./Readme/3227-vowels-game-in-a-string.md)                                            |
+| 3233 | [Find the Count of Numbers Which Are Not Special](https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special)                                       | [Python](./Python/3233-find-the-count-of-numbers-which-are-not-special.py)                    | [Medium](./Readme/3233-find-the-count-of-numbers-which-are-not-special.md)                    |
 | 3239 | [Minimum Number of Flips to Make Binary Grid Palindromic I](https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i)                   | [Python](./Python/3239-minimum-number-of-flips-to-make-binary-grid-palindromic-i.py)          | [Medium](./Readme/3239-minimum-number-of-flips-to-make-binary-grid-palindromic-i.md)          |
 | 3243 | [Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i)                                       | [Python](./Python/3243-shortest-distance-after-road-addition-queries-i.py)                    | [Medium](./Readme/3243-shortest-distance-after-road-addition-queries-i.md)                    |
 | 3249 | [Count the Number of Good Nodes](https://leetcode.com/problems/count-the-number-of-good-nodes)                                                                         | [Python](./Python/3249-count-the-number-of-good-nodes.py)                                     | [Medium](./Readme/3249-count-the-number-of-good-nodes.md)                                     |
@@ -99,7 +100,6 @@
 | 3325 | [Count Substrings with K Frequency Characters I](https://leetcode.com/problems/count-substrings-with-k-frequency-characters-i)                                         | [Python](./Python/3325-count-substrings-with-k-frequency-characters-i.py)                     | [Medium](./Readme/3325-count-substrings-with-k-frequency-characters-i.md)                     |
 | 3330 | [Find the Original Typed String I](https://leetcode.com/problems/find-the-original-typed-string-i)                                                                     | [Python](./Python/3330-find-the-original-typed-string-i.py)                                   | [Easy](./Readme/3330-find-the-original-typed-string-i.md)                                     |
 | 3331 | [Find Subtree Sizes After Changes](https://leetcode.com/problems/find-subtree-sizes-after-changes)                                                                     | [Python](./Python/3331-find-subtree-sizes-after-changes.py)                                   | [Medium](./Readme/3331-find-subtree-sizes-after-changes.md)                                   |
-| 3233 | [Find the Count of Numbers Which Are Not Special](https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special)                                       | [Python](./Python/3233-find-the-count-of-numbers-which-are-not-special.py)                    | [Medium](./Readme/3233-find-the-count-of-numbers-which-are-not-special.md)                    |
 | 3334 | [Find the Maximum Factor Score of Array](https://leetcode.com/problems/find-the-maximum-factor-score-of-array)                                                         | [Python](./Python/3334-find-the-maximum-factor-score-of-array.py)                             | [Medium](./Readme/3334-find-the-maximum-factor-score-of-array.md)                             |
 | 3335 | [Total Characters in String After Transformations I](https://leetcode.com/problems/total-characters-in-string-after-transformations-i)                                 | [Python](./Python/3335-total-characters-in-string-after-transformations-i.py)                 | [Medium](./Readme/3335-total-characters-in-string-after-transformations-i.md)                 |
 | 3337 | [Total Characters in String After Transformations II](https://leetcode.com/problems/total-characters-in-string-after-transformations-ii)                               | [Python](./Python/3337-total-characters-in-string-after-transformations-ii.py)                | [Hard](./Readme/3337-total-characters-in-string-after-transformations-ii.md)                  |

3610-find-x-sum-of-all-k-long-subarrays-i/3610-find-x-sum-of-all-k-long-subarrays-i.py

@@ -115,36 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Array
-|  |
-| ------- |
-| [1700-minimum-time-to-make-rope-colorful](https://github.com/hogan-tech/leetcode-solution/tree/master/1700-minimum-time-to-make-rope-colorful) |
-| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
-## String
-|  |
-| ------- |
-| [1700-minimum-time-to-make-rope-colorful](https://github.com/hogan-tech/leetcode-solution/tree/master/1700-minimum-time-to-make-rope-colorful) |
-## Dynamic Programming
-|  |
-| ------- |
-| [1700-minimum-time-to-make-rope-colorful](https://github.com/hogan-tech/leetcode-solution/tree/master/1700-minimum-time-to-make-rope-colorful) |
-## Greedy
-|  |
-| ------- |
-| [1700-minimum-time-to-make-rope-colorful](https://github.com/hogan-tech/leetcode-solution/tree/master/1700-minimum-time-to-make-rope-colorful) |
-## Hash Table
-|  |
-| ------- |
-| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
-## Sliding Window
-|  |
-| ------- |
-| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
-## Heap (Priority Queue)
-|  |
-| ------- |
-| [3610-find-x-sum-of-all-k-long-subarrays-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3610-find-x-sum-of-all-k-long-subarrays-i) |
-<!---LeetCode Topics End-->

3610-find-x-sum-of-all-k-long-subarrays-i/README.md

@@ -1,4 +1,4 @@
-<h2><a href="https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/">3318. Find X-Sum of All K-Long Subarrays I</a></h2><h3>Easy</h3><hr><div><p>You are given an array <code>nums</code> of <code>n</code> integers and two integers <code>k</code> and <code>x</code>.</p>
+<h2><a href="https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i">3610. Find X-Sum of All K-Long Subarrays I</a></h2><h3>Easy</h3><hr><p>You are given an array <code>nums</code> of <code>n</code> integers and two integers <code>k</code> and <code>x</code>.</p>
 
 <p>The <strong>x-sum</strong> of an array is calculated by the following procedure:</p>
 
@@ -12,8 +12,6 @@
 
 <p>Return an integer array <code>answer</code> of length <code>n - k + 1</code> where <code>answer[i]</code> is the <strong>x-sum</strong> of the <span data-keyword="subarray-nonempty">subarray</span> <code>nums[i..i + k - 1]</code>.</p>
 
-<p>A <strong>subarray</strong> is a contiguous <b>non-empty</b> sequence of elements within an array.</p>
-
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
@@ -51,4 +49,3 @@
 	<li><code>1 &lt;= nums[i] &lt;= 50</code></li>
 	<li><code>1 &lt;= x &lt;= k &lt;= nums.length</code></li>
 </ul>
-</div>