Added 2958, 2962

Author: trung-hn

Readme.md

@@ -259,7 +259,7 @@
 | 593  | [Valid Square](src/593.valid-square.py)                                                                                                                              | Medium | O(1)                  | O(1)           | Math                                                                                                 |                                         |           |
 | 605  | [Can Place Flowers](src/605.can-place-flowers.py)                                                                                                                    | Easy   | O(N)                  | O(1)           | Array, Greedy                                                                                        |                                         |           |
 | 611  | [Valid Triangle Number](src/611.valid-triangle-number.py)                                                                                                            | Medium | O(N^2)                | O(1)           | Array, Two Pointers, Binary Search, Greedy, Sorting                                                  |                                         |           |
-| 621  | [Task Scheduler](src/621.task-scheduler.py)                                                                                                                          | Medium | O(N)                  | O(1)           | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting                                  | Greedy                                         |           |
+| 621  | [Task Scheduler](src/621.task-scheduler.py)                                                                                                                          | Medium | O(N)                  | O(1)           | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting                                  | Greedy                                  |           |
 | 622  | [Design Circular Queue](src/622.design-circular-queue.py)                                                                                                            | Medium | O(1)                  | O(1)           | Design, Queue                                                                                        |                                         |           |
 | 623  | [Add One Row to Tree](src/623.add-one-row-to-tree.py)                                                                                                                | Medium | O(N)                  | O(N)           | Tree                                                                                                 |                                         |           |
 | 624  | [Maximum Distance in Arrays](src/624.py)                                                                                                                             | Easy   | O(N)                  | O(1)           | Hash Table, Array, Premium                                                                           |                                         | 🔒         |
@@ -695,6 +695,8 @@
 | 2487 | [Remove Nodes From Linked List](src/2487.remove-nodes-from-linked-list.py)                                                                                           | Medium | O(N)                  | O(N)           | Linked List, Stack, Recursion, Monotonic Stack                                                       |                                         |           |
 | 2498 | [Frog Jump II](src/2498.frog-jump-ii.py)                                                                                                                             | Medium | O(N)                  | O(1)           | Array, Binary Search, Greedy                                                                         |                                         |           |
 | 2517 | [Maximum Tastiness of Candy Basket](src/2517.maximum-tastiness-of-candy-basket.py)                                                                                   | Medium | O(NlogN)              | O(1)           | Array, Binary Search, Sorting                                                                        |                                         |           |
+| 2958 | [Length of Longest Subarray With at Most K Frequency](src/2958.length-of-longest-subarray-with-at-most-k-frequency.py)                                               | Medium | O(N)                  | O(N)           | Array, Hash Table, Sliding Window                                                                    |                                         |           |
+| 2962 | [Count Subarrays Where Max Element Appears at Least K Times](src/2962.count-subarrays-where-max-element-appears-at-least-k-times.py)                                 | Medium | O(N)                  | O(N)           | Array, Sliding Window                                                                                |                                         |           |
 | 2966 | [Divide Array Into Arrays With Max Difference](src/2966.divide-array-into-arrays-with-max-difference.py)                                                             | Medium | O(NlogN)              | O(N)           | Array, Greedy, Sorting                                                                               |                                         |           |
 | 2971 | [Find Polygon With the Largest Perimeter](src/2971.find-polygon-with-the-largest-perimeter.py)                                                                       | Medium | O(N)                  | O(N)           | Array, Greedy, Sorting, Prefix Sum                                                                   |                                         |           |
 | 3005 | [Count Elements With Maximum Frequency](src/3005.count-elements-with-maximum-frequency.py)                                                                           | Easy   | O(N)                  | O(N)           | Array, Hash Table, Counting                                                                          |                                         |           |

src/2958.length-of-longest-subarray-with-at-most-k-frequency.py

@@ -0,0 +1,28 @@
+#
+# @lc app=leetcode id=2958 lang=python3
+#
+# [2958] Length of Longest Subarray With at Most K Frequency
+#
+
+
+# @lc code=start
+# TAGS: Array, Hash Table, Sliding Window
+import collections
+from typing import List
+
+
+class Solution:
+    # Time and Space: O(N)
+    def maxSubarrayLength(self, nums: List[int], k: int) -> int:
+        ans = index = 0
+        counter = collections.defaultdict(int)
+        for i, num in enumerate(nums):
+            counter[num] += 1
+            while counter[num] > k:
+                counter[nums[index]] -= 1
+                index += 1
+            ans = max(ans, i - index + 1)
+        return ans
+
+
+# @lc code=end

src/2962.count-subarrays-where-max-element-appears-at-least-k-times.py

@@ -0,0 +1,31 @@
+#
+# @lc app=leetcode id=2962 lang=python3
+#
+# [2962] Count Subarrays Where Max Element Appears at Least K Times
+#
+
+
+# @lc code=start
+# TAGS: Array, Sliding Window
+import collections
+from typing import List
+
+
+class Solution:
+    # Time and Space:O(N)
+    def countSubarrays(self, nums: List[int], k: int) -> int:
+        ans = index = 0
+        mx = max(nums)
+        counter = collections.Counter()
+        for i, num in enumerate(nums):
+            counter[num] += 1
+            while counter[mx] > k or nums[index] != mx:
+                counter[nums[index]] -= 1
+                index += 1
+            if counter[mx] < k:
+                continue
+            ans += index + 1
+        return ans
+
+
+# @lc code=end