当前标签：sliding window

[LeetCode] 2779. Maximum Beauty of an Array After Applying Operation

CNoodle 2024-12-19 03:04 阅读:7 评论:0 推荐:0 编辑

[LeetCode] 2958. Length of Longest Subarray With at Most K Frequency

CNoodle 2024-12-17 04:39 阅读:4 评论:0 推荐:0 编辑

[LeetCode] 2730. Find the Longest Semi-Repetitive Substring

CNoodle 2024-12-16 11:51 阅读:4 评论:0 推荐:0 编辑

[LeetCode] 1297. Maximum Number of Occurrences of a Substring

CNoodle 2024-12-13 14:53 阅读:3 评论:0 推荐:0 编辑

[LeetCode] 3206. Alternating Groups I

CNoodle 2024-11-26 04:08 阅读:7 评论:0 推荐:0 编辑

[LeetCode] 2516. Take K of Each Character From Left and Right

CNoodle 2024-11-21 02:31 阅读:11 评论:0 推荐:0 编辑

[LeetCode] 1652. Defuse the Bomb

CNoodle 2024-11-19 04:36 阅读:5 评论:0 推荐:0 编辑

[LeetCode] 3090. Maximum Length Substring With Two Occurrences

CNoodle 2024-11-10 12:08 阅读:6 评论:0 推荐:0 编辑

[LeetCode] 2841. Maximum Sum of Almost Unique Subarray

CNoodle 2024-11-10 04:56 阅读:5 评论:0 推荐:0 编辑

[LeetCode] 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold

CNoodle 2024-11-10 02:47 阅读:4 评论:0 推荐:0 编辑

[LeetCode] 2134. Minimum Swaps to Group All 1s Together II

CNoodle 2024-08-04 02:56 阅读:23 评论:0 推荐:0 编辑

[LeetCode] 2903. Find Indices With Index and Value Difference I

CNoodle 2024-05-26 13:10 阅读:2 评论:0 推荐:0 编辑

[LeetCode] 2831. Find the Longest Equal Subarray

CNoodle 2024-05-23 05:27 阅读:15 评论:0 推荐:0 编辑

[LeetCode] 2962. Count Subarrays Where Max Element Appears at Least K Times

CNoodle 2024-03-30 06:26 阅读:30 评论:0 推荐:0 编辑

[LeetCode] 2461. Maximum Sum of Distinct Subarrays With Length K

CNoodle 2023-07-19 13:09 阅读:108 评论:0 推荐:0 编辑

[LeetCode] 2024. Maximize the Confusion of an Exam

CNoodle 2023-07-07 09:14 阅读:92 评论:0 推荐:0 编辑

[LeetCode] 1493. Longest Subarray of 1's After Deleting One Element

CNoodle 2023-06-29 05:04 阅读:155 评论:0 推荐:0 编辑

[LeetCode] 1456. Maximum Number of Vowels in a Substring of Given Length

CNoodle 2023-05-06 00:34 阅读:159 评论:0 推荐:0 编辑

[LeetCode] 2379. Minimum Recolors to Get K Consecutive Black Blocks

CNoodle 2023-03-09 01:38 阅读:54 评论:0 推荐:0 编辑

[LintCode] 1375. Substring With At Least K Distinct Characters

CNoodle 2022-06-25 08:47 阅读:213 评论:0 推荐:0 编辑